Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference3 articles.
1. Problems and results on 3-chromatic hypergraphs and some related questions;Erdős,1975
2. Covers in uniform intersecting families and a counterexample to a conjecture of Lovász;Frankl;J. Combin. Theory Ser. A,1996
3. Inequalities for minimal covering sets in set systems of given rank;Tuza;Discrete Appl. Math.,1994
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the size of maximal intersecting families;Combinatorics, Probability and Computing;2023-09-08
2. Independence Numbers of Johnson-Type Graphs;Bulletin of the Brazilian Mathematical Society, New Series;2023-06-12
3. Pseudo sunflowers;European Journal of Combinatorics;2022-08
4. Extremal problems in hypergraph colourings;Russian Mathematical Surveys;2020-02-01
5. A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families;Combinatorics, Probability and Computing;2019-06-04