Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
DOI10.1134/S1064562421040074zbMath1478.05137OpenAlexW3214004568MaRDI QIDQ2246874
V. S. Karas', P. A. Ogarok, Andrei M. Raigorodskii
Publication date: 16 November 2021
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562421040074
Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- 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
- Independence numbers of random subgraphs of some distance graph
- On a Frankl-Wilson theorem
- Estimate of the number of edges in special subgraphs of a distance graph
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
- On the chromatic numbers corresponding to exponentially Ramsey sets
- Estimate of the number of edges in subgraphs of a Johnson graph
- On threshold probability for the stability of independent sets in distance graphs
- Equitable colorings of hypergraphs with few edges
- On the weak chromatic number of random hypergraphs
- On the chromatic number of random subgraphs of a certain distance graph
- Degree versions of theorems on intersecting families via stability
- Removal and Stability for Erdös--Ko--Rado
- On “stability” in the Erdös--Ko--Rado Theorem
- Rainbow matchings in k‐partite hypergraphs
- Ramsey theory in the -space with Chebyshev metric
This page was built for publication: Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\)
