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

DOI10.1016/j.ejc.2022.103664OpenAlexW3085501791MaRDI QIDQ2700974

Soheil Azarpendar, A. H. Jafari

Publication date: 27 April 2023

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

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

Mathematics Subject Classification ID

Graph theory (05Cxx) Enumerative combinatorics (05Axx) Extremal combinatorics (05Dxx)

Cites Work

• On the chromatic number of general Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• A generalized Kneser conjecture
• Generalized Kneser coloring theorems with combinatorial proofs
• On the generalized Erdős-Kneser conjecture: proofs and reductions
• A new lower bound for the chromatic number of general Kneser hypergraphs
• On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
• On the chromatic number of generalized Kneser hypergraphs
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• Chromatic Numbers of Stable Kneser Hypergraphs via Topological Tverberg-Type Theorems

This page was built for publication: Lower bounds for the chromatic number of certain Kneser-type hypergraphs