On the stability of the independence number of a random subgraph

DOI10.1134/S1064562417060266zbMath1388.05171OpenAlexW2782277821MaRDI QIDQ1707163

Andrei M. Raigorodskii

Publication date: 28 March 2018

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562417060266

zbMATH Keywords

asymptotic stability of the independence numbers of random subgraphsinfinite sequence of growing graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

On Ramsey numbers for arbitrary sequences of graphs ⋮ On the sizes of large subgraphs of the binomial random graph ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the independence number and the chromatic number of generalized preferential attachment models ⋮ Maximum sparse induced subgraphs of the binomial random graph with given number of edges ⋮ On the random version of the Erdős matching conjecture ⋮ Random Kneser graphs and hypergraphs ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ The size of a maximum subgraph of the random graph with a given number of edges ⋮ On the chromatic number of random subgraphs of a certain distance graph ⋮ Degree versions of theorems on intersecting families via stability ⋮ Regular intersecting families ⋮ 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
• Lovász' theorem on the chromatic number of spheres revisited
• Independence numbers of random subgraphs of a distance graph
• Independence numbers of random subgraphs of distance graphs
• Turán type results for distance graphs
• On chromatic numbers of nearly Kneser 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
• On the stability of some Erdős-Ko-Rado type results
• On random subgraphs of Kneser graphs and their generalizations
• On the stability of the Erdős-Ko-Rado theorem
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Combinatorial Geometry and Coding Theory*
• Unnamed Item
• Unnamed Item

This page was built for publication: On the stability of the independence number of a random subgraph