Independence numbers of random subgraphs of a distance graph

DOI10.1134/S000143461601034XzbMath1338.05069OpenAlexW4253400666MaRDI QIDQ296011

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 graphErdős-Rényi modelrandom subgraph

Mathematics Subject Classification ID

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

Related Items (12)

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

Cites Work

• On the chromatic numbers of spheres in \(\mathbb R^n\)
• Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs
• On the chromatic numbers of spheres in Euclidean spaces
• Distance graphs with large chromatic numbers and small clique numbers
• Codes with forbidden distances
• Excursions into combinatorial geometry
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• Coloring some finite sets in {R}^{n}
• The Mathematical Coloring Book
• On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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