Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference4 articles.
1. Intersection theorems for finite sets;Katona;Acta. Math. Acad. Sci. Hungar.,1964
2. Intersection theorems for finite sets;Erdös;Quart. J. Math. Oxford Ser.,1961
3. A finite set covering theorem I;Brace;Bull. Austral. Math. Soc.,1971
4. Families of non-disjoint subsets;Kleitman;J. Combin. Theory.,1966
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A proof of Frankl–Kupavskii's conjecture on edge‐union condition;Journal of Graph Theory;2024-01-07
2. Beyond the Erdős Matching Conjecture;European Journal of Combinatorics;2021-06
3. Some exact results for multiply intersecting families;Journal of Combinatorial Theory, Series B;2019-05
4. Multiply union families in Nn;European Journal of Combinatorics;2016-11
5. Multiply-intersecting families;Journal of Combinatorial Theory, Series B;1991-11