On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs

DOI10.1016/j.jctb.2020.09.014zbMath1457.05071arXiv2002.01748OpenAlexW3091428063MaRDI QIDQ2221931

Soheil Azarpendar, A. H. Jafari

Publication date: 3 February 2021

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

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

zbMATH Keywords

simplicial complexeschromatic numberKneser hypergraphs\( \mathbb{Z}_p\)-Tucker lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of simplicial complexes (05E45)

Related Items

Lower bounds for the chromatic number of certain Kneser-type hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic number of general Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• A generalized Kneser conjecture
• Kneser's conjecture, chromatic number, and homotopy
• On generalized Kneser hypergraph colorings
• Generalized Kneser coloring theorems with combinatorial proofs
• On the generalized Erdős-Kneser conjecture: proofs and reductions
• Simple proofs of some Borsuk-Ulam results
• The Chromatic Number of Kneser Hypergraphs
• On the imbedding of systems of compacta in simplicial complexes

This page was built for publication: On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs