Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. On complete subgraphs of different orders;Bollobás;Math. Proc. Cambridge Philos. Soc,1976
2. Intersection theorems for systems of finite sets;Erdős;Quart. J. Math. Oxford Ser. (2),1961
3. Some intersection theorems for systems of finite sets;Hilton;Quart. J. Math. Oxford Ser. (2),1967
4. M. Kneser, Aufgabe 360, Jahresber. Deutsch. Math.-Verein. 2 Abteilung 58 (1955) 27.
5. Kneser's conjecture, chromatic number and homotopy;Lovász;J. Combin. Theory Ser. A,1978
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Trivial colors in colorings of Kneser graphs;Discrete Mathematics;2024-04
2. Arrangements of k-sets with intersection constraints;European Journal of Combinatorics;2012-11
3. Erdős–Ko–Rado in Random Hypergraphs;Combinatorics, Probability and Computing;2009-09
4. Structure and stability of triangle-free set systems;Transactions of the American Mathematical Society;2006-08-16