A combinatorial proof of Kneser's conjecture

Combinatorica

Volumn 24, Issue 1, 2004, Pages 163-170

  Matoušek, Jiří ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2542539824     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-004-0011-1     Document Type: Article

References (19)

1. N. ALON, P. FRANKL and L. LOVASZ: The chromatic number of Kneser hypergraphs, Trans. Amer. Math. Soc. 298 (1986), 359-370.
2. I. BÁRÁNY: A short proof of Kneser's conjecture, J. Combinatorial Theory Ser. A 25 (1978), 325-326.
3. n and a connection between the Helly and Borsuk theorems, Russian Acad. Sci. Sb. Math. 79 (1994), 93-107. Translated from Ross. Akad. Nauk Matem. Sbornik, Tom 184, No. 5, 1993.
4. n and a connection between the Helly and Borsuk theorems, Russian Acad. Sci. Sb. Math. 79 (1994), 93-107. Translated from Ross. Akad. Nauk Matem. Sbornik, Tom 184, No. 5, 1993.
5. V. L. DOL'NIKOV: Transversals of families of sets, In Studies in the theory of functions of several real variables (Russian), pages 30-36, 109. Yaroslav, Gos. Univ., Yaroslavl', 1981.
6. R. M. FREUND: Variable dimension complexes II: A unified approach to some combinatorial lemmas in topology, Math. Oper. Res., 9 (1984), 498-509.
7. R. M. FREUND and M. J. TODD: A constructive proof of Tucker's combinatorial lemma, J. Combinatorial Theory Ser. A 30 (1981), 321-325.
8. M. KNESER: Aufgabe 360, Jahresbericht der Deutschen Mathematiker- Vereinigung 2. Abteilung 58 (1955), pp. 27.
9. I. KŘÍŽ: Equivariant cohomology and lower bounds for chromatic numbers, Trans. Amer. Math. Soc. 333 (1992), 567-577.
10. I. KŘÍŽ: A correction to "Equivariant cohomology and lower bounds for chromatic numbers" (Trans. Amer. Math. Soc. 333 (1992), 567-577), Trans. Amer. Math. Soc. 352(4) (2000), 1951-1952.
11. I. KŘÍŽ: A correction to "Equivariant cohomology and lower bounds for chromatic numbers" (Trans. Amer. Math. Soc. 333 (1992), 567-577), Trans. Amer. Math. Soc. 352(4) (2000), 1951-1952.
12. S. LEFSCHETZ: Introduction to Topology, Princeton, 1949.
13. L. LOVÁSZ: Kneser's conjecture, chromatic number and homotopy, J. Combinatorial Theory Ser. A 25 (1978), 319-324.
14. J. MATOUŠEK: On the chromatic number of Kneser hypergraphs, Proc. Amer. Math. Soc. 130 (2002), 2509-2514.
15. J. MATOUŠEK: Using the Borsuk-Ulam theorem, Springer, Berlin 2003.
16. J. MATOUŠEK and G. M. ZIEGLER: Topological lower bounds for the chromatic number: A hierarchy, Jahresbericht der Deutschen Mathematiker- Vereinigung, in press, 2004.
17. K. S. SARKARIA: A generalized Kneser conjecture, J. Combinatorial Theory Ser. B 49 (1990), 236-240.
18. A. W. TUCKER: Some topological properties of disk and sphere, In Proc. First Canadian Math. Congr., Montreal 1945, pages 285-309, Univ. of Toronto Press, 1946.
19. G. M. ZIEGLER: Generalized Kneser coloring theorems with combinatorial proofs, Invent. Math. 147 (2002), 671-691.