Existential monadic second order convergence law fails on sparse random graphs
Abstract
In the paper, we prove that existential monadic second order convergence law fails for the binomial random graph G(n,n-α) for every α∈(0,1).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.