Chromatic number of random Kneser hypergraphs

DOI10.1016/j.jcta.2017.08.010zbMath1373.05057arXiv1607.07432OpenAlexW2963896466MaRDI QIDQ1679319

Meysam Alishahi, Hossein Hajiabolhassan

Publication date: 9 November 2017

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

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

zbMATH Keywords

chromatic number of hypergraphs\(\mathbb{Z}_p\)-Tucker lemmarandom Kneser hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

Choice number of Kneser graphs, Sharp bounds for the chromatic number of random Kneser graphs, Estimating the \(r\)-colorability threshold for a random hypergraph, On the random version of the Erdős matching conjecture, On stability of the independence number of a certain distance graph, Random Kneser graphs and hypergraphs, Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On random subgraphs of Kneser and Schrijver graphs
• A simple removal lemma for large nearly-intersecting families
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• On the chromatic number of general Kneser hypergraphs
• Hedetniemi's conjecture for Kneser hypergraphs
• The chromatic number of almost stable Kneser hypergraphs
• Kneser's conjecture, chromatic number, and homotopy
• On the stability of the Erdős-Ko-Rado theorem
• A short proof of Kneser's conjecture
• Generalized Kneser coloring theorems with combinatorial proofs
• A combinatorical proof of Kneser's conjecture
• Chromatic number via Turán number
• Strengthening topological colorful results for graphs
• Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
• On “stability” in the Erdös--Ko--Rado Theorem
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• The Chromatic Number of Kneser Hypergraphs
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers