Independence numbers of random subgraphs of some distance graph

DOI10.1134/S0032946017040019MaRDI QIDQ2190887zbMATH OpenOpenAlexFDO

Authors N. M. Derevyanko, S. G. Kiselev

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

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

Recommendations

• Independence numbers of random subgraphs of a distance graph
• Independence numbers of random subgraphs of distance graphs
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• On threshold probability for the stability of independent sets in distance graphs

Cites work

• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Combinatorial geometry and coding theory
• scientific article; zbMATH DE number 3906527 (Why is no real title available?)
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• Independence numbers of random subgraphs of a distance graph
• Independence numbers of random subgraphs of distance graphs
• On random subgraphs of Kneser and Schrijver graphs
• On random subgraphs of Kneser graphs and their generalizations
• On the chromatic numbers of low-dimensional spaces
• On the stability of some Erdős-Ko-Rado type results
• On the stability of the Erdös-Ko-Rado theorem
• On the stability of the Erdős-Ko-Rado theorem
• Transference for the Erdős-Ko-Rado theorem

Cited in

(17)

• On the stability of the independence number of a random subgraph
• Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
• 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
• The number of edges in induced subgraphs of some distance graphs
• Clique numbers of random subgraphs of some distance graphs
• On the chromatic number of random subgraphs of a certain distance graph
• Degree versions of theorems on intersecting families via stability
• Independence numbers of random subgraphs of a distance graph
• Independence numbers of random subgraphs of distance graphs
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• Maximum induced trees in sparse random graphs
• Sharp bounds for the chromatic number of random Kneser graphs
• Johnson graphs, their random subgraphs, and some of their extremal characteristics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190887)