A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The logic of random regular graphs

2010
*
Journal of Combinatorics
*

The first order language of graphs is a formal language in which one can express many properties of graphs -known as first order properties. The classic Zero-One law for random graphs states that if p is some constant probability then for every first order property the limiting probability of the binomial random graph G(n, p) having this property is either zero or one. The case of sparse random graphs has also been studied in detail for the binomial random graph model. We obtain results for

doi:10.4310/joc.2010.v1.n4.a3
fatcat:ygdujdrtjvf27ifwlaokq7zoeq