A weak zero-one law for sequences of random distance graphs

DOI10.1070/SM2012V203N07ABEH004252zbMATH Open1254.05183OpenAlexW2047133497MaRDI QIDQ4650141FDOQ4650141

Authors: M. E. Zhukovskii 

Publication date: 23 November 2012

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

Full work available at URL: https://doi.org/10.1070/sm2012v203n07abeh004252

Recommendations

• The weak zero-one law for the random distance graphs
• 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 law for random subgraphs of some distance graphs with vertices in \( \mathbb Z^n\)
• Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\)

zbMATH Keywords

zero-one lawsEhrenfeucht gamefirst-order languagerandom distance graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Zero-one laws (60F20)

Cited In (11)

• Zero-one laws for graphs with edge probabilities decaying with distance. Part II
• Small subgraphs and their extensions in a random distance graph
• The weak zero-one laws for the random distance graphs
• 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\)
• Zero-one law for random subgraphs of some distance graphs with vertices in \( \mathbb Z^n\)
• On a sequence of random distance graphs subject to the zero-one law
• The weak zero-one law for the random distance graphs
• Large cycles in random generalized Johnson graphs
• Zero-one laws for graphs with edge probabilities decaying with distance. Part I
• Zero-one laws for random graphs with vertices in a Boolean cube

This page was built for publication: A weak zero-one law for sequences of random distance graphs

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