Name
Abstract | ||
|---|---|---|
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+(n-10)+(n-11)+(n-12) for all n=1, with equality only achieved by the family of sets 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.disc.2011.06.024 | Discrete Mathematics |
Keywords | Field | DocType |
d -simplex,nonuniform set system,d-simplex | Family of sets,Discrete mathematics,Combinatorics,Simplex,Mathematics | Journal |
Volume | Issue | ISSN |
311 | 20 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael E. Picollelli | 1 | 10 | 2.56 |