On generalized Kneser hypergraph colorings

Journal of Combinatorial Theory. Series A

Volumn 114, Issue 1, 2007, Pages 159-166

  Lange, Carsten E M C ^a   Ziegler, Günter M ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Colorings of hypergraphs; Intersection multiplicities; Kneser hypergraphs

Indexed keywords

EID: 33750710796     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2006.02.003     Document Type: Article

References (11)

1. Alon N., Frankl P., and Lovász L. The chromatic number of Kneser hypergraphs. Trans. Amer. Math. Soc. 298 (1986) 359-370
2. Berge C. Hypergraphs. Combinatorics of Finite Sets. North-Holland Math. Library vol. 45 (1989), North-Holland, Amsterdam
3. Erdo{combining double acute accent}s P., and Hajnal A. On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hungar. 17 (1966) 61-99
4. Kneser M. Aufgabe 360. Jahresber. Deutsch. Math.-Verein. 58 2. Abteilung (1955) 27
5. Kříž I. Equivariant cohomology and lower bounds for chromatic numbers. Trans. Amer. Math. Soc. 33 (1992) 567-577
6. Kříž I. A correction to "Equivariant cohomology and lower bounds for chromatic numbers". Trans. Amer. Math. Soc. 352 (2000) 1951-1952
7. Lange C. Combinatorial curvatures, group actions, and colourings: Aspects of topological combinatorics, PhD thesis, TU Berlin, 2004. see also math.CO/0312067
8. Matoušek J., and Ziegler G.M. Topological lower bounds for the chromatic number: A hierarchy. Jahresber. Deutsch. Math.-Verein. 106 (2004) 71-90. http://www.arXiv.org/math.CO/0208072
9. Sarkaria K.S. A generalized Kneser conjecture. J. Combin. Theory Ser. B 49 (1990) 236-240
10. Ziegler G.M. Generalized Kneser coloring theorems with combinatorial proofs. Invent. Math. 147 (2002) 671-691. http://www.arXiv.org/math.CO/0103146
11. Ziegler G.M. Erratum: Generalized Kneser coloring theorems with combinatorial proofs. Invent. Math. 163 (2006) 227-228