Author:
Füredi Zoltán,Özkahya Lale
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. Counterexample to the Frankl–Pach conjecture for uniform, dense families;Ahlswede;Combinatorica,1997
2. Design Theory;Beth,1999
3. On generalized graphs;Bollobás;Acta Math. Acad. Sci. Hungar.,1965
4. Families of sets with intersecting clusters;Chen;SIAM J. Discrete Math.,2009
5. An extremal set-intersection theorem;Chvátal;J. Lond. Math. Soc.,1974
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献