On the chromatic number of generalized Kneser hypergraphs

DOI10.1016/j.ejc.2019.05.003zbMath1420.05055arXiv1805.11421OpenAlexW2963877737WikidataQ127830226 ScholiaQ127830226MaRDI QIDQ2323090

Hamid Reza Daneshpajouh

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberKneser hypergraphs

Mathematics Subject Classification ID

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

We Found 2 Related Items (max. 100)

On the number of star‐shaped classes in optimal colorings of Kneser graphs ⋮ Lower bounds for the chromatic number of certain Kneser-type hypergraphs

Cites Work

• Unnamed Item
• On chromatic numbers of nearly Kneser distance graphs
• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• On the chromatic number of general Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• Generalized Kneser coloring theorems with combinatorial proofs
• New construction of graphs with high chromatic number and small clique number
• A combinatorical proof of Kneser's conjecture
• On chromatic numbers of close-to-Kneser distance graphs
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• The Chromatic Number of Kneser Hypergraphs
• A New Short Proof of Kneser's Conjecture
• Chromatic Numbers of Stable Kneser Hypergraphs via Topological Tverberg-Type Theorems

This page was built for publication: On the chromatic number of generalized Kneser hypergraphs