Asymptotic upper bounds on the shades of t-intersecting families

Details Asymptotic upper bounds on the shades of t-intersecting families Asymptotic upper bounds on the shades of t-intersecting families

2008-08-11

arxiv.org/abs/0808.1434v1

Mathematics

Combinatorics

8 pages. Homepage of the paper will be: http://homepage.univie.ac.at/James.Hirschorn/research/asymptotic.ub/asymptotic.ub.html

Scientific paper

We examine the m-shades of t-intersecting families of k-subsets of [n], and conjecture on the optimal upper bound on their cardinalities. This conjecture extends Frankl's General Conjecture that was proven true by Ahlswede-Khachatrian. From this we deduce the precise asymptotic upper bounds on the cardinalities of m-shades of t(m)-intersecting families of k(m)-subsets of [2m], as m -> infinity. A generalization to cross-t-intersecting families is also considered.

Affiliated with

Also associated with

No associations

Rating

Asymptotic upper bounds on the shades of t-intersecting families does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic upper bounds on the shades of t-intersecting families, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic upper bounds on the shades of t-intersecting families will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492600