Chromatic Numbers of Stable Kneser Hypergraphs via Topological Tverberg-Type Theorems

DOI10.1093/imrn/rny135zbMath1447.05079arXiv1710.09434OpenAlexW2964050663MaRDI QIDQ5115695

Florian Frick

Publication date: 17 August 2020

Published in: International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberstable Knesser hypergraph

Mathematics Subject Classification ID

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

Related Items

Fair splittings by independent sets in sparse graphs ⋮ A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs ⋮ Lower bounds for the chromatic number of certain Kneser-type hypergraphs ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ On the chromatic number of generalized Kneser hypergraphs