Hedetniemi's conjecture for Kneser hypergraphs

DOI10.1016/j.jcta.2016.05.002zbMath1342.05094arXiv1410.3021OpenAlexW1515028822WikidataQ123265806 ScholiaQ123265806MaRDI QIDQ530765

Frédéric Meunier, Hossein Hajiabolhassan

Publication date: 1 August 2016

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

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

zbMATH Keywords

Kneser graphsKneser hypergraphs\(Z_p\)-Tucker lemmacategorical productHedetniemi conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

We Found 7 Related Items (max. 100)

Strengthening topological colorful results for graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Hedetniemi's conjecture from the topological viewpoint ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Hedetniemi's conjecture is asymptotically false ⋮ A new lower bound for the chromatic number of general Kneser hypergraphs ⋮ Counterexamples to Hedetniemi's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colorful subhypergraphs in Kneser hypergraphs
• On the chromatic number of general Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• A category-theoretical approach to hypergraphs
• On topological relaxations of chromatic conjectures
• Kneser's conjecture, chromatic number, and homotopy
• On generalized Kneser hypergraph colorings
• Local chromatic number, Ky Fan's theorem, and circular colorings
• On the b-chromatic number of Kneser graphs
• Hom complexes and homotopy theory in the category of graphs
• A certain combinatorial inequality
• n-tuple colorings and associated graphs
• A survey on Hedetniemi's conjecture
• Generalized Kneser coloring theorems with combinatorial proofs
• Topological lower bounds for the chromatic number: a hierarchy
• A combinatorical proof of Kneser's conjecture
• Chromatic number via Turán number
• Colorful subgraphs in Kneser-like graphs
• Independence and coloring properties of direct products of some vertex-transitive graphs
• On the diameter of Kneser graphs
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers

This page was built for publication: Hedetniemi's conjecture for Kneser hypergraphs