On the chromatic number of Kneser hypergraphs

Proceedings of the American Mathematical Society

Volumn 130, Issue 9, 2002, Pages 2509-2514

  Matoušek, Jiří ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036721284     PISSN: 00029939     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0002-9939-02-06371-2     Document Type: Conference Paper

References (18)

1. The chromatic number of Kneser hypergraphs
2. A short proof of Kneser's conjecture
3. Topological methods
4. Simple proofs of some borsuk-ulam results
5. Transversals of families of sets
6. A combinatorial inequality
7. n and a connection between the helly and borsuk theorems
8. Aufgabe 360
9. On the estimation of the number of critical points of functionals
10. Equivariant cohomology and lower bounds for chromatic numbers
11. A correction to "equivariant cohomology and lower bounds for chromatic numbers"
12. Kneser's conjecture, chromatic number and homotopy
13. A combinatorial proof of kneser's conjecture
14. A generalized kneser conjecture
15. Generalized kneser coloring theorems with combinatorial proofs
16. User's guide to equivariant methods in combinatorics
17. Topological methods