Zero-one laws for random distance graphs with vertices in \0,1\^n

DOI10.1134/S1064562414060040zbMATH Open1311.05172OpenAlexW1985440074MaRDI QIDQ2254100FDOQ2254100

Authors: Yanyan Li 

Publication date: 4 February 2015

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

Full work available at URL: https://doi.org/10.1134/s1064562414060040

Recommendations

• 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 laws for the random distance graphs
• The weak zero-one law for the random distance graphs
• On a sequence of random distance graphs subject to the zero-one law
• A weak zero-one law for sequences of random distance graphs
• Zero-one laws for graphs with edge probabilities decaying with distance. Part I
• Zero-one laws for graphs with edge probabilities decaying with distance. Part II
• Zero-one laws for random \(k\)-partite graphs
• Zero-One Laws for Sparse Random Graphs

zbMATH Keywords

random graphEhrenfeucht game0-1 lawfirst-order propertyrandom distance graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)

Cites Work

• Probabilities on finite models
• Coloring distance graphs and graphs of diameters
• Zero-One Laws for Sparse Random Graphs
• The probabilistic method
• Distance graphs with large chromatic numbers and small clique numbers
• The weak zero-one laws for the random distance graphs
• A weak zero-one law for sequences of random distance graphs
• On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements

Cited In (11)

• Zero-one laws for graphs with edge probabilities decaying with distance. Part II
• The tenacity of zero-one laws
• Discrete metric spaces: structure, enumeration, and 0-1 laws
• 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 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\)
• Zero-One Laws for Connectivity in Inhomogeneous Random Key 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: Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\)

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