Independence numbers of random subgraphs of distance graphs

DOI10.1134/S0001434616030299zbMath1347.05151MaRDI QIDQ325669

M. M. Pyaderkin

Publication date: 18 October 2016

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

independence numberdistance graphErdős-Rényi modelrandom subgraphErdős-Ko-Rado problem

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)

Large cycles in generalized Johnson graphs ⋮ Independence numbers of random subgraphs of some distance graph ⋮ Chromatic numbers of some distance graphs ⋮ On the stability of the independence number of a random subgraph ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ 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 ⋮ Large cycles in random generalized Johnson graphs ⋮ Clique numbers of random subgraphs of some distance graphs ⋮ 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

• Independence numbers of random subgraphs of a distance graph
• 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 stability of the Erdös-Ko-Rado theorem
• On the chromatic numbers of spheres in Euclidean spaces
• On the stability of the Erdős-Ko-Rado theorem
• Forbidding just one intersection
• Codes with forbidden distances
• Around Borsuk's hypothesis
• 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
• Combinatorial Geometry and Coding Theory*
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• 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 distance graphs