Abstract
AbstractLet 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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference6 articles.
1. Inequalities for minimal covering sets in set systems of given rank
2. On the minimax theorems of combinatorics (in Hungarian);Lovász;Mat. Lapok,1975
3. [4] 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.
4. Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Uniform intersecting families with large covering number;European Journal of Combinatorics;2023-10
2. On the size of maximal intersecting families;Combinatorics, Probability and Computing;2023-09-08
3. Independence Numbers of Johnson-Type Graphs;Bulletin of the Brazilian Mathematical Society, New Series;2023-06-12
4. Pseudo sunflowers;European Journal of Combinatorics;2022-08
5. Diversity;Journal of Combinatorial Theory, Series A;2021-08