Small subgraphs in random distance graphs

DOI10.1137/S0040585X97T987739MaRDI QIDQ2821762zbMATH OpenFDO

Authors A. V. Burkin

Publication date 23 September 2016

Published in Theory of Probability and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0040585X97T987739

zbMATH Keywords

distance graphplanarityrandom graphsmall subgraphsthreshold function

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Small subgraphs and their extensions in a random distance graph
• scientific article; zbMATH DE number 747034
• Small subgraphs of random regular graphs
• scientific article; zbMATH DE number 17684
• Small subgraphs in the trace of a random walk
• scientific article; zbMATH DE number 4179409
• On small subgraphs in a random intersection digraph
• Distribution of small subgraphs in Buckley-Osthus random graphs
• On Subgraph Sizes in Random Graphs
• Subgraphs of Random Graphs

Cites work

• Around Borsuk's hypothesis
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring distance graphs and graphs of diameters
• scientific article; zbMATH DE number 5935733 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 4041966 (Why is no real title available?)
• scientific article; zbMATH DE number 1231233 (Why is no real title available?)
• scientific article; zbMATH DE number 2070003 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Non-Separable and Planar Graphs
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• On the non-planarity of a random subgraph
• On the probability of the occurrence of a copy of a fixed graph in a random distance graph
• Random graphs.
• The Borsuk problem for (0,1)-polyhedra and cross polytopes.
• The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The problems of Borsuk and Grunbaum on lattice polytopes
• The Structure of a Random Graph at the Point of the Phase Transition
• The transitive closure of a random digraph
• Three lectures on the Borsuk partition problem
• Threshold functions for small subgraphs
• Гигантская компонента в случайных дистанционных графах специального вида

Cited in

(8)

• On the probability of the occurrence of a copy of a fixed graph in a random distance graph
• On distance subgraphs of graphs in spaces of lower dimensions
• Large cycles in random generalized Johnson graphs
• Small subgraphs and their extensions in a random distance graph
• Small Submatroids in Random Matroids
• On embedding random graphs into distance graphs and graphs of diameters in Euclidean spaces
• Small subgraphs in random graphs and the power of multiple choices
• Large cycles in generalized Johnson graphs

This page was built for publication: Small subgraphs in random distance graphs

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