No CrossRef data available.
Article contents
On the size of maximal intersecting families
Published online by Cambridge University Press: 08 September 2023
Abstract
We show that an $n$-uniform maximal intersecting family has size at most $e^{-n^{0.5+o(1)}}n^n$. This improves a recent bound by Frankl ((2019) Comb. Probab. Comput. 28(5) 733–739.). The Spread Lemma of Alweiss et al. ((2020) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing.) plays an important role in the proof.
MSC classification
Primary:
05D05: Extremal set theory
- Type
- Paper
- Information
- Copyright
- © The Author(s), 2023. Published by Cambridge University Press
References
Alweiss, R., Lovett, S., Wu, K. and Zhang, J. (2020) Improved bounds for the sunflower lemma. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing.Google Scholar
Arman, A. and Retter, T. (2017) An upper bound for the size of a
$k$
-uniform intersecting family with covering number
$k$
. J. Comb. Theory Ser. A 147 18–26.CrossRefGoogle Scholar
Cherkashin, D. (2011) On hypergraph cliques with chromatic number 3. Moscow J. Comb. Number Theory 1(3) 3–11.Google Scholar
Erdős, P. and Lovász, L. (1973) Problems and results on 3-chromatic hypergraphs and some related questions. Coll. Math. Soc. Janos Bolyai 10. Infin. Finite Sets, Keszthely (Hungary).Google Scholar
Frankl, P. (2017) Antichains of fixed diameter. Mosc. J. Comb. Number Theory 7(3) 3–33.Google Scholar
Frankl, P. (2019) A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. Comb. Prob. Comput. 28(5) 733–739.Google Scholar
Frankl, P., Ota, K. and Tokushige, N. (1996) Covers in uniform intersecting families and a counterexample to a conjecture of Lovász. J. Comb. Theory Ser. A 74(1) 33–42.Google Scholar
Gyárfás, A. (1977) Partition covers and blocking sets in hypergraphs. MTA SZTAKI Tanulmányok 71.Google Scholar
Jukna, S. (2011) Extremal Combinatorics: With Applications in Computer Science. Springer Science & Business Media.Google Scholar
Kahn, J. (1994) On a problem of Erdős and Lovász. II. n(r)=O(r). J. Am. Math. Soc. 7(1) 125–143.Google Scholar
Tao, T. The sunflower lemma via shannon entropy. Available at: https://terrytao.wordpress.com/2020/07/20/the-sunflower-lemma-via-shannon-entropy/.Google Scholar
Tuza, Z. (1994) Inequalities for minimal covering sets in set systems of given rank. Discrete Appl. Math. 51(1-2) 187–195.Google Scholar