The chromatic number of almost stable Kneser hypergraphs

DOI10.1016/j.jcta.2011.02.010zbMath1297.05087arXiv0912.4748OpenAlexW2046584470MaRDI QIDQ543913

Frédéric Meunier

Publication date: 17 June 2011

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

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

zbMATH Keywords

chromatic numbercombinatorial topology\(Z_{p}\)-Tucker lemmastable Kneser hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15)

Related Items (26)

The automorphism group of the \(s\)-stable Kneser graphs ⋮ The neighborhood complexes of almost \(s\)-stable Kneser graphs ⋮ On the neighborhood complex of \(\overrightarrow{s} \)-stable Kneser graphs ⋮ Chromatic number of random Kneser hypergraphs ⋮ Fair splittings by independent sets in sparse graphs ⋮ Colorings of complements of line graphs ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ On the diameter of Schrijver graphs ⋮ On the number of star‐shaped classes in optimal colorings of Kneser graphs ⋮ 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 ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Random Kneser graphs and hypergraphs ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ Shifts of the stable Kneser graphs and hom-idempotence ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ Dold's theorem from viewpoint of strong compatibility graphs ⋮ On the chromatic number of generalized Kneser hypergraphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ The complexity of finding fair independent sets in cycles ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• Combinatorial Stokes formulas via minimal resolutions
• Generalized Kneser coloring theorems with combinatorial proofs
• Neighborhood complexes of stable Kneser graphs
• A combinatorical proof of Kneser's conjecture
• Combinatorial Stokes formulae
• 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
• 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: The chromatic number of almost stable Kneser hypergraphs