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

DOI10.1134/S0032946014010049zbMath1308.05096MaRDI QIDQ2262992

S. N. Popova

Publication date: 17 March 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

sequences of random distance graphs

Mathematics Subject Classification ID

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

Related Items (2)

Small subgraphs and their extensions in a random distance graph ⋮ Zero-one laws for random graphs with vertices in a Boolean cube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic numbers of spheres in \(\mathbb R^n\)
• On the chromatic number of a space with two forbidden distances
• The weak zero-one laws for the random distance graphs
• On the chromatic numbers of spheres in Euclidean spaces
• Counterexamples to Borsuk's conjecture on spheres of small radius
• Gigantic component in random distance graphs of special form
• Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
• Coloring Distance Graphs and Graphs of Diameters
• Research Problems in Discrete Geometry
• Zero-One Laws for Sparse Random Graphs
• Probabilities on finite models
• The chromatic number of a space with the metric $ l_q$

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