Author:
Bollobás Béla,Keevash Peter,Sudakov Benny
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. On the density of sets of vectors;Alon;Discrete Math.,1983
2. On generalized graphs;Bollobás;Acta Math. Acad. Sci. Hungar.,1965
3. Combinatorics, Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability;Bollobás,1986
4. Sets of independent edges of a hypergraph;Bollobás;Quart. J. Math. Oxford Ser.,1976
5. A generalization of Sperner's theorem;Daykin;J. Austral. Math. Soc. Ser. A,1981
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Localized versions of extremal problems;European Journal of Combinatorics;2023-08
2. Several families with incomparability and complementarity conditions;Discrete Applied Mathematics;2019-08
3. Multicolour Sunflowers;Combinatorics, Probability and Computing;2018-04-22
4. A Rainbow Erdös--Rothschild Problem;SIAM Journal on Discrete Mathematics;2017-01
5. A remark on the number of edge colorings of graphs;European Journal of Combinatorics;2006-05