Independence numbers of random subgraphs of some distance graph

DOI10.1134/S0032946017040019zbMath1442.05206OpenAlexW2794067751MaRDI QIDQ2190887

S. G. Kiselev, N. M. Derevyanko

Publication date: 23 June 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

Maximum sparse induced subgraphs of the binomial random graph with given number of edges ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ 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 ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)

Cites Work

• Unnamed Item
• 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 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
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• On the chromatic numbers of low-dimensional spaces
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Combinatorial Geometry and Coding Theory*

This page was built for publication: Independence numbers of random subgraphs of some distance graph