On the chromatic number of general Kneser hypergraphs

DOI10.1016/j.jctb.2015.05.010zbMath1319.05046arXiv1302.5394OpenAlexW585142893MaRDI QIDQ490992

Hossein Hajiabolhassan, Meysam Alishahi

Publication date: 21 August 2015

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

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

zbMATH Keywords

chromatic numberKneser hypergraphs\(Z_p\)-Tucker lemmaTucker-Ky Fan's lemma

Mathematics Subject Classification ID

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

Related Items (23)

Strengthening topological colorful results for graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ Concerning a conjecture on matching Kneser graphs ⋮ On the number of star‐shaped classes in optimal colorings of Kneser graphs ⋮ New construction of graphs with high chromatic number and small clique number ⋮ Altermatic number of categorical product of graphs ⋮ Lower bounds for the chromatic number of certain Kneser-type hypergraphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs ⋮ Topological Bounds for Graph Representations over Any Field ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ A new lower bound for the chromatic number of general Kneser hypergraphs ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ Chromatic number via Turán number ⋮ Dold's theorem from viewpoint of strong compatibility graphs ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ On the chromatic number of generalized Kneser hypergraphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ On chromatic number and minimum cut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chromatic number of almost stable Kneser hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Circular coloring and Mycielski construction
• Coloring graphs with locally few colors
• Evenly distributed subsets of \(S^ n\) and a combinatorial application
• Fractional multiples of graphs and the density of vertex-transitive graphs
• Circular chromatic number of Kneser graphs
• Generalized Kneser coloring theorems with combinatorial proofs
• A short proof for Chen's alternative Kneser coloring lemma
• Box complexes, neighborhood complexes, and the chromatic number
• A combinatorical proof of Kneser's conjecture
• Colourful theorems and indices of homomorphism complexes
• A new coloring theorem of Kneser graphs
• Colorful subgraphs in Kneser-like graphs
• A generalization of Tucker's combinatorial lemma with topological applications
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• Kneser Representations of 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
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• A topological lower bound for the circular chromatic number of Schrijver graphs
• The chromatic covering number of a graph
• A generalization of Kneser's conjecture
• 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
• Circular chromatic number: A survey

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