Sharp bounds for the chromatic number of random Kneser graphs
From MaRDI portal
Publication:6621230
Andrey B. Kupavskii, Sergei Kiselev
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- On random subgraphs of Kneser and Schrijver graphs
- Independence numbers of random subgraphs of a distance graph
- Independence numbers of random subgraphs of distance 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 the Erdös-Ko-Rado theorem
- On the stability of some Erdős-Ko-Rado type results
- On random subgraphs of Kneser graphs and their generalizations
- Random Kneser graphs and hypergraphs
- On the chromatic number of a random subgraph of the Kneser graph
- Kneser's conjecture, chromatic number, and homotopy
- On the stability of the Erdős-Ko-Rado theorem
- Chromatic number of random Kneser hypergraphs
- Regular bipartite graphs and intersecting families
- On the stability of the independence number of a random subgraph
- Independence numbers of random subgraphs of some distance graph
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Clique chromatic numbers of intersection graphs
- On the chromatic number of random subgraphs of a certain distance graph
- New upper bound for the chromatic number of a random subgraph of a distance graph
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- 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
- Families with no s pairwise disjoint sets
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE 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
This page was built for publication: Sharp bounds for the chromatic number of random Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621230)