Abstract
We say that a random graph obeys the zero-one -law if every property expressed by a first-order formula with quantifier depth at most holds with probability tending to or . It is known that the random graph obeys the zero-one -law for every and every positive irrational , as well as for all rational which are not of the form (for any positive integer ). It is also known that for all other rational positive , the random graph does not obey the zero-one -law for sufficiently large . In this paper we put and obtain upper and lower bounds for the largest such that the zero-one -law holds.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
