On the generalized Erdős-Kneser conjecture: proofs and reductions

DOI10.1016/j.jctb.2018.08.004zbMath1404.05133arXiv1712.03456OpenAlexW2962781966MaRDI QIDQ1719585

Shuli Chen, Florian Frick, Jai Aslam, Linus Setiabrata, Ethan Coldren

Publication date: 8 February 2019

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

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

zbMATH Keywords

chromatic numbertopological Tverberg theoremKneser conjectureKneser hypergraph

Mathematics Subject Classification ID

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

Related Items

Lower bounds for the chromatic number of certain Kneser-type hypergraphs, On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs, A new lower bound for the chromatic number of general Kneser hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic number of general Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• A generalized Kneser conjecture
• Kneser's conjecture, chromatic number, and homotopy
• On generalized Kneser hypergraph colorings
• Generalized Kneser coloring theorems with combinatorial proofs
• A new lower bound for the chromatic number of general Kneser hypergraphs
• Optimal bounds for the colored Tverberg problem
• Intersection patterns of finite sets and of convex sets
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
• The Chromatic Number of Kneser Hypergraphs
• Chromatic Numbers of Stable Kneser Hypergraphs via Topological Tverberg-Type Theorems
• A Generalization of Radon's Theorem
• Classifying unavoidable Tverberg partitions