Independence numbers of random subgraphs of a distance graph

DOI10.1134/S000143461601034XMaRDI QIDQ296011zbMATH OpenOpenAlexFDO

Authors M. M. Pyaderkin

Publication date 14 June 2016

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

independence numberdistance graphrandom subgraphErdős-Rényi model

Mathematics Subject Classification ID

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

Recommendations

• Independence numbers of random subgraphs of distance graphs
• Independence numbers of random subgraphs of some distance graph
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• On the independence number of random graphs
• scientific article; zbMATH DE number 1507217
• On the independence number of random interval graphs
• On the independence ratio of distance graphs
• On the stability of the independence number of a random subgraph
• The independent domination number of random graph

Cites work

• scientific article; zbMATH DE number 6536189 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 51916 (Why is no real title available?)
• scientific article; zbMATH DE number 3458659 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 1943977 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Borsuk's problem and the chromatic numbers of some metric spaces
• Codes with forbidden distances
• Coloring distance graphs and graphs of diameters
• Coloring some finite sets in \(\mathbb R^n\)
• Excursions into combinatorial geometry
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
• On the chromatic numbers of spheres in Euclidean spaces
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• Random graphs.
• Random graphs.
• The Mathematical Coloring Book
• Three lectures on the Borsuk partition problem

Cited in

(18)

• Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
• On stability of the independence number of a certain distance graph
• 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
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• On the chromatic number of random subgraphs of a certain distance graph
• Independence numbers of random subgraphs of distance graphs
• On the chromatic numbers of low-dimensional spaces
• On the stability of the independence number of a random subgraph
• Sharp bounds for the chromatic number of random Kneser graphs
• Independence numbers of random subgraphs of some distance graph
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
• On random subgraphs of Kneser graphs and their generalizations
• Independence numbers of Johnson-type graphs
• On the chromatic number of a random subgraph of the Kneser graph
• Estimate of the number of edges in special subgraphs of a distance graph
• Clique numbers of random subgraphs of some distance graphs
• The number of edges in induced subgraphs of some distance graphs

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

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