On generalized Kneser hypergraph colorings

DOI10.1016/j.jcta.2006.02.003zbMath1111.05037arXivmath/0504607OpenAlexW1990499656MaRDI QIDQ857422

Carsten E. M. C. Lange, Günter M. Ziegler

Publication date: 14 December 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0504607

zbMATH Keywords

colorings of hypergraphsintersection multiplicities

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On the Chromatic Thresholds of Hypergraphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs ⋮ Hedetniemi's conjecture for Kneser hypergraphs

Cites Work

• Unnamed Item
• A generalized Kneser conjecture
• Generalized Kneser coloring theorems with combinatorial proofs
• Topological lower bounds for the chromatic number: a hierarchy
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• On chromatic number of graphs and set-systems

This page was built for publication: On generalized Kneser hypergraph colorings