Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,
From MaRDI portal
Publication:2113406
DOI10.1134/S0001434622010138zbMath1484.05189OpenAlexW4213429878MaRDI QIDQ2113406
V. S. Karas', Andrei M. Raigorodskii
Publication date: 14 March 2022
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434622010138
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (2)
Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions ⋮ Large cycles in random generalized Johnson graphs
Cites Work
- Unnamed Item
- Independence numbers of random subgraphs of a distance graph
- Independence numbers of random subgraphs of distance 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
- 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
- The complete nontrivial-intersection theorem for systems of finite sets
- Sharp results concerning disjoint cross-intersecting families
- Independence numbers of random subgraphs of some distance graph
- A generalization of Kneser graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- Modularity of some distance graphs
- New bounds for the clique-chromatic numbers of Johnson graphs
- Estimate of the number of edges in subgraphs of a Johnson graph
- On threshold probability for the stability of independent sets in distance graphs
- Incompatible intersection properties
- On the chromatic number of random subgraphs of a certain distance graph
- Degree versions of theorems on intersecting families via stability
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Borsuk's problem and the chromatic numbers of some metric spaces
- Removal and Stability for Erdös--Ko--Rado
- On “stability” in the Erdös--Ko--Rado Theorem
- Coloring Distance Graphs and Graphs of Diameters
- 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
- Combinatorial Geometry and Coding Theory*
- Extremal problems in hypergraph colourings
- Simple juntas for shifted families
- Ramsey theory in the -space with Chebyshev metric
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Almost-Fisher families
- On intersecting families of finite sets
This page was built for publication: Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
