Small subgraphs and their extensions in a random distance graph

DOI10.1070/SM8674zbMath1390.05052arXiv1701.06917OpenAlexW2582732437MaRDI QIDQ4568577

M. E. Zhukovskii, Anton V. Burkin

Publication date: 22 June 2018

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06917

zbMATH Keywords

distance graphrandom graphthreshold functionsmall subgraphsextension properties

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Distance in graphs (05C12)

Related Items (4)

Large cycles in generalized Johnson graphs ⋮ The median of the number of simple paths on three vertices in the random graph ⋮ Large cycles in random generalized Johnson graphs ⋮ Zero-one laws for sentences with \(k\) variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a sequence of random distance graphs subject to the zero-one law
• Intersection theorems with geometric consequences
• Threshold functions for extension statements
• On the probability of the occurrence of a copy of a fixed graph in a random distance graph
• Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
• Borsuk's problem and the chromatic numbers of some metric spaces
• A counterexample to Borsuk’s conjecture
• Research Problems in Discrete Geometry
• Threshold functions for small subgraphs
• A weak zero-one law for sequences of random distance graphs
• Гигантская компонента в случайных дистанционных графах специального вида
• Random graphs: models and asymptotic characteristics

This page was built for publication: Small subgraphs and their extensions in a random distance graph