On the chromatic number of a random subgraph of the Kneser graph
From MaRDI portal
Publication:679977
DOI10.1134/S1064562417050209zbMATH Open1378.05062OpenAlexW2765494462MaRDI QIDQ679977FDOQ679977
Authors: S. G. Kiselev, Andrei M. Raigorodskii 
Publication date: 22 January 2018
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562417050209
Cites Work
- Random graphs.
- On random subgraphs of Kneser and Schrijver graphs
- Lovász' theorem on the chromatic number of spheres revisited
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
- On the stability of the Erdős-Ko-Rado theorem
- Independence numbers of random subgraphs of a distance graph
- On the number of edges in induced subgraphs of a special distance graph
- Combinatorial Geometry and Coding Theory*
- On chromatic numbers of nearly Kneser distance graphs
- On the stability of some Erdős-Ko-Rado type results
- On random subgraphs of Kneser graphs and their generalizations
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On the chromatic numbers of low-dimensional spaces
- Colorings of partial Steiner systems and their applications
Cited In (16)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- Degree versions of theorems on intersecting families via stability
- Chromatic number of random Kneser hypergraphs
- On threshold probability for the stability of independent sets in distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- On the random version of the Erdős matching conjecture
- Sharp bounds for the chromatic number of random Kneser graphs
- Estimating the \(r\)-colorability threshold for a random hypergraph
- A generalization of Kneser graphs
- Two values of the chromatic number of a sparse random graph
- On the chromatic number of a subgraph of the Kneser graph
- Sharp bounds for the chromatic number of random Kneser graphs
- Fractional chromatic number of a random subgraph
- Random Kneser graphs and hypergraphs
- Estimate of the number of edges in special subgraphs of a distance graph
- The number of edges in induced subgraphs of some distance graphs
This page was built for publication: On the chromatic number of a random subgraph of the Kneser graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679977)
