The chromatic number of kneser hypergraphs
暂无分享,去创建一个
Noga Alon | László Lovász | Peter Frankl | N. Alon | P. Frankl | L. Lovász
[1] P. Erdös. On an extremal problem in graph theory , 1970 .
[2] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.
[3] László Lovász,et al. Homotopy properties of greedoids , 1985 .
[4] P. Os,et al. Problems and Results in Combinatorial Analysis , 1978 .
[5] D. G. Bourgin. Modern algebraic topology , 1963 .
[6] Vojtech Rödl,et al. Hypergraphs do not jump , 1984, Comb..
[7] E. J. Cockayne,et al. The Ramsey number for stripes , 1975 .
[8] E. J. Cockayne,et al. On Ramsey Graph Numbers for Stars and Stripes , 1975, Canadian Mathematical Bulletin.
[9] Peter Frankl,et al. On the chromatic number of the general Kneser-graph , 1985, J. Graph Theory.
[10] Charles H. Goldberg,et al. Bisection of Circle Colorings , 1985 .
[11] Miklós Simonovits,et al. Supersaturated graphs and hypergraphs , 1983, Comb..
[12] Imre Bárány,et al. On a Topological Generalization of a Theorem of Tverberg , 1981 .
[13] K. Borsuk. On the imbedding of systems of compacta in simplicial complexes , 1948 .
[14] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .
[15] Imre Bárány,et al. A Short Proof of Kneser's Conjecture , 1978, J. Comb. Theory, Ser. A.
[16] Zoltán Füredi,et al. Extremal problems concerning Kneser graphs , 1986, J. Comb. Theory, Ser. B.
[17] N. Alon,et al. The Borsuk-Ulam theorem and bisection of necklaces , 1986 .
[18] J. Spencer. Intersection Theorems for Systems of Sets , 1977, Canadian Mathematical Bulletin.
[19] P. Erdos. Problems and Results in Combinatorial Analysis , 2022 .
[20] P. Turán. On the theory of graphs , 1954 .
[21] Peter Frankl,et al. On intersecting families of finite sets , 1978, Bulletin of the Australian Mathematical Society.