Colorful subhypergraphs in Kneser hypergraphs

zbMath1300.05202arXiv1306.1112MaRDI QIDQ405073

Frédéric Meunier

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial topologyKneser hypergraphscolorful complete \(p\)-partite hypergraphlocal chromatic number

Mathematics Subject Classification ID

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

Related Items (7)

Strengthening topological colorful results for graphs ⋮ Altermatic number of categorical product of graphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic number of general Kneser hypergraphs
• 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
• Combinatorial Stokes formulas via minimal resolutions
• Coloring graphs with locally few colors
• Evenly distributed subsets of \(S^ n\) and a combinatorial application
• n-tuple colorings and associated graphs
• Generalized Kneser coloring theorems with combinatorial proofs
• Topological lower bounds for the chromatic number: a hierarchy
• A combinatorical proof of Kneser's conjecture
• Colorful subgraphs in Kneser-like graphs
• On the diameter of Kneser graphs
• A generalization of Tucker's combinatorial lemma with topological applications
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• A topological lower bound for the circular chromatic number of Schrijver graphs

This page was built for publication: Colorful subhypergraphs in Kneser hypergraphs