On the Multichromatic Number of s‐Stable Kneser Graphs

DOI10.1002/JGT.21826zbMath1316.05040OpenAlexW2160346379MaRDI QIDQ5265332

Peng-An Chen

Publication date: 23 July 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21826

zbMATH Keywords

Kneser graphMycielskianmultichromatic number\(s\)-stable \(r\)-uniform Kneser hypergraph\(s\)-stable Kneser graph

Mathematics Subject Classification ID

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

Related Items (5)

The neighborhood complexes of almost \(s\)-stable Kneser graphs ⋮ On the neighborhood complex of \(\overrightarrow{s} \)-stable Kneser graphs ⋮ Colorings of complements of line graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

Cites Work

• Unnamed Item
• The chromatic number of almost stable Kneser hypergraphs
• A special case of the stahl conjecture
• Kneser's conjecture, chromatic number, and homotopy
• Local chromatic number, Ky Fan's theorem, and circular colorings
• Multicoloring and Mycielski construction
• n-tuple colorings and associated graphs
• Circular chromatic number of Kneser graphs
• The multichromatic numbers of some Kneser graphs
• Generalized Kneser coloring theorems with combinatorial proofs
• A short proof for Chen's alternative Kneser coloring lemma
• A combinatorical proof of Kneser's conjecture
• Graph powers and graph homomorphisms
• A new coloring theorem of Kneser graphs
• A generalization of Tucker's combinatorial lemma with topological applications
• Multiple Coloring of Cone Graphs
• Circular chromatic numbers of some reduced Kneser graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Multi-coloring the Mycielskian of graphs
• Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
• The Chromatic Number of Kneser Hypergraphs
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• INTERSECTING FAMILIES OF SEPARATED SETS
• A topological lower bound for the circular chromatic number of Schrijver graphs

This page was built for publication: On the Multichromatic Number of s‐Stable Kneser Graphs