Article contents
A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families
Part of:
Graph theory
Published online by Cambridge University Press: 04 June 2019
Abstract
Let m(k) denote the maximum number of edges in a non-extendable, intersecting k-graph. Erdős and Lovász proved that m(k) ≤ kk. For k ≥ 625 we prove m(k) < kk・e−k1/4/6.
- Type
- Paper
- Information
- Copyright
- © Cambridge University Press 2019
References
Arman, A. and Retter, T. (2017) An upper bound for the size of a k-uniform intersecting family with covering number k. J. Combin. Theory Ser. A 147 18–26.CrossRefGoogle Scholar
Erdős , P. and Lovász, L. (1974) Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets: Proc. Colloq. Math. Soc. János Bolyai, Keszthely, Hungary, 1973, North-Holland, pp. 609–627.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. Combin. Theory Ser. A 74 33–42.CrossRefGoogle Scholar
Gyárfás, A. (1977) Partition covers and blocking sets in hypergraphs (in Hungarian). Thesis, Studies of Computer and Automation Research Institute of Hungarian Academy of Sciences, 177.Google Scholar
Lovász, L. (1975) On the minimax theorems of combinatorics (in Hungarian). Mat. Lapok 26 209–264.Google Scholar
Tuza, Z. (1994) Inequalities for minimal covering sets in set systems of given rank. Discrete Appl. Math . 51 187–195.CrossRefGoogle Scholar
- 7
- Cited by