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

DOI10.1134/S1064562414060040zbMath1311.05172OpenAlexW1985440074MaRDI QIDQ2254100

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

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

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

This page was built for publication: Zero-one laws for random distance graphs with vertices in \(\{0,1\}^n\)