A new lower bound for the chromatic number of general Kneser hypergraphs

DOI10.1016/J.EJC.2018.03.007zbMath1387.05075arXiv1704.07052OpenAlexW2608779825WikidataQ129922837 ScholiaQ129922837MaRDI QIDQ1750225

Roya Abyazi Sani, Meysam Alishahi

Publication date: 18 May 2018

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

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

zbMATH Keywords

independence numbercolorful complete \(p\)-partite hypergraphKneser's conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (3)

Lower bounds for the chromatic number of certain Kneser-type hypergraphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions

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
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Generalized Kneser coloring theorems with combinatorial proofs
• On the generalized Erdős-Kneser conjecture: proofs and reductions
• A short proof for Chen's alternative Kneser coloring lemma
• Colourful theorems and indices of homomorphism complexes
• A new coloring theorem of Kneser graphs
• Colorful subgraphs in Kneser-like graphs
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
• Simple proofs of some Borsuk-Ulam results
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• Equitable Coloring
• Equitable Coloring ofk-Uniform Hypergraphs
• 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

This page was built for publication: A new lower bound for the chromatic number of general Kneser hypergraphs