Random Kneser graphs and hypergraphs
From MaRDI portal
Publication:668022
zbMath1409.05184arXiv1612.03868MaRDI QIDQ668022
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.03868
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Choice number of Kneser graphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ Estimating the \(r\)-colorability threshold for a random hypergraph ⋮ A generalization of Kneser graphs ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ Exact modularity of line graphs of complete graphs ⋮ New lower bound on the modularity of Johnson graphs ⋮ On the chromatic numbers of random hypergraphs ⋮ Chromatic numbers of Kneser-type graphs ⋮ Large cycles in random generalized Johnson graphs ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- On random subgraphs of Kneser and Schrijver graphs
- On chromatic numbers of nearly Kneser distance graphs
- Improved bounds for Erdős' matching conjecture
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- On the stability of some Erdős-Ko-Rado type results
- On random subgraphs of Kneser graphs and their generalizations
- 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
- Chromatic number of random Kneser hypergraphs
- Families with no matchings of size \(s\)
- On the stability of the independence number of a random subgraph
- Sharp bounds for the chromatic number of random Kneser graphs
- Removal and Stability for Erdös--Ko--Rado
- On “stability” in the Erdös--Ko--Rado Theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
- The Chromatic Number of Kneser Hypergraphs
- Equivariant Cohomology and Lower Bounds for Chromatic Numbers
- On the chromatic number of Kneser hypergraphs
- Families with no s pairwise disjoint sets
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Random Kneser graphs and hypergraphs
