The weak zero-one laws for the random distance graphs
From MaRDI portal
Publication:606499
DOI10.1134/S1064562410010151zbMath1238.03033OpenAlexW2029625034MaRDI QIDQ606499
Publication date: 17 November 2010
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1064562410010151
Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Zero-one laws (60F20) Model theory of finite structures (03C13)
Related Items (7)
Zero-one \(k\)-law ⋮ On the probability of the occurrence of a copy of a fixed graph in a random distance graph ⋮ Zero-one laws for first-order formulas with a bounded quantifier depth ⋮ Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\) ⋮ Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\) ⋮ On a sequence of random distance graphs subject to the zero-one law ⋮ Zero-one laws for random graphs with vertices in a Boolean cube
Cites Work
This page was built for publication: The weak zero-one laws for the random distance graphs
