It is known that an Erdös-Rényi random graph obeys a zero-one law for first-order properties. The study of these laws started in 1969 with the work of Yu.V. Glebskii, D.I. Kogan, M.I. Liogon’kii, and V.A. Talanov. We proved in our previous works that a random distance graph does not obey the zero-one law. In this paper a sequence of random distance graphs obeying the zero-one law is obtained.
Problems of Information Transmission – Springer Journals
Published: Oct 11, 2011
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud