Coloring properties of categorical product of general Kneser hypergraphs

DOI10.26493/1855-3974.1414.58bzbMath1497.05097arXiv1705.00223OpenAlexW2963906468WikidataQ129389539 ScholiaQ129389539MaRDI QIDQ4615057

Meysam Alishahi, Roya Abyazi Sani, Ali Taherkhani

Publication date: 1 February 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberHedetniemi's conjecturecategorical productgeneral Kneser hypergraph

Mathematics Subject Classification ID

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

Related Items

Hedetniemi's conjecture from the topological viewpoint

Cites Work

• Unnamed Item
• Unnamed Item
• Colorful subhypergraphs in Kneser hypergraphs
• On the chromatic number of general Kneser hypergraphs
• Colorful subhypergraphs in uniform hypergraphs
• Hedetniemi's conjecture for Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• A category-theoretical approach to hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• A certain combinatorial inequality
• A survey on Hedetniemi's conjecture
• Generalized Kneser coloring theorems with combinatorial proofs
• A new lower bound for the chromatic number of general Kneser hypergraphs
• A short proof for Chen's alternative Kneser coloring lemma
• A combinatorical proof of Kneser's conjecture
• Strengthening topological colorful results for graphs
• A new coloring theorem of Kneser graphs
• Colorful subgraphs in Kneser-like graphs
• Simple proofs of some Borsuk-Ulam results
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler