On a sequence of random distance graphs subject to the zero-one law
From MaRDI portal
Publication:764404
DOI10.1134/S0032946011030045zbMATH Open1242.03058OpenAlexW1994224610MaRDI QIDQ764404FDOQ764404
Authors: M. E. Zhukovskii
Publication date: 13 March 2012
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946011030045
Recommendations
- A weak zero-one law for sequences of random distance graphs
- The weak zero-one laws for the random distance graphs
- Zero-one law for random subgraphs of some distance graphs with vertices in \( \mathbb Z^n\)
- The weak zero-one law for the random distance graphs
- Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Distance in graphs (05C12) Zero-one laws (60F20)
Cites Work
Cited In (10)
- Small subgraphs and their extensions in a random distance graph
- The weak zero-one laws for the random distance graphs
- A weak zero-one law for sequences of random distance graphs
- MSO zero-one laws on random labelled acyclic 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\)
- The weak zero-one law for the random distance 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: On a sequence of random distance graphs subject to the zero-one law
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764404)