Small Subgraphs in Random Distance Graphs

DOI10.1137/S0040585X97T987739zbMath1345.05093MaRDI QIDQ2821762

Anton V. Burkin

Publication date: 23 September 2016

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

zbMATH Keywords

planarity; distance graph; random graph; threshold function; small subgraphs

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

05C12: Distance in graphs

Related Items

Large cycles in generalized Johnson graphs, Large cycles in random generalized Johnson graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
• On the probability of the occurrence of a copy of a fixed graph in a random distance graph
• Around Borsuk's hypothesis
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• The transitive closure of a random digraph
• The problems of Borsuk and Grunbaum on lattice polytopes
• Threshold functions for small subgraphs
• The Structure of a Random Graph at the Point of the Phase Transition
• Non-Separable and Planar Graphs
• Гигантская компонента в случайных дистанционных графах специального вида
• On the Non-Planarity of a Random Subgraph
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs