The neighborhood complexes of almost \(s\)-stable Kneser graphs

DOI10.1016/j.ejc.2018.09.002zbMath1402.05078OpenAlexW2897501026MaRDI QIDQ1633605

József Osztényi

Publication date: 20 December 2018

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2018.09.002

zbMATH Keywords

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

Mathematics Subject Classification ID

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

We Found 1 Related Items (max. 100)

On the neighborhood complex of \(\overrightarrow{s} \)-stable Kneser graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shifts of the stable Kneser graphs and hom-idempotence
• The chromatic number of almost stable Kneser hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• A short proof of Kneser's conjecture
• Morse theory for cell complexes
• Generalized Kneser coloring theorems with combinatorial proofs
• Neighborhood complexes of stable Kneser graphs
• Zum Gedächtnis an Georg Hamel
• On the Multichromatic Number of s‐Stable Kneser Graphs
• 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
• Combinatorial algebraic topology

This page was built for publication: The neighborhood complexes of almost \(s\)-stable Kneser graphs