Set systems without a 3-simplex

Details Set systems without a 3-simplex Set systems without a 3-simplex

2010-10-25

arxiv.org/abs/1010.5206v1

Mathematics

Combinatorics

5 pages

Scientific paper

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} + \binom{n-1}{0} + \binom{n-1}{1} + \binom{n-1}{2}$ for all $n \ge 1$, with equality only achieved by the family of sets either containing a given element or of size at most 2. This extends a result of Keevash and Mubayi, who showed the conclusion for n sufficiently large.

Affiliated with

Also associated with

No associations

Rating

Set systems without a 3-simplex 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 Set systems without a 3-simplex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Set systems without a 3-simplex will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-94524