On zero-one and convergence laws for graphs embeddable on a fixed surface
Document typeConference report
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Rights accessOpen Access
European Commisision's projectEC-H2020-648276-AUTAR-
We show that for no surface except for the plane does monadic second-order logic (MSO) have a zero-one-law - and not even a convergence law - on the class of (connected) graphs embeddable on the surface. In addition we show that every rational in [0,1] is the limiting probability of some MSO formula. This strongly refutes a conjecture by Heinig et al. (2014) who proved a convergence law for planar graphs, and a zero-one law for connected planar graphs, and also identified the so-called gaps of [0,1]: the subintervals that are not limiting probabilities of any MSO formula. The proof relies on a combination of methods from structural graph theory, especially large face-width embeddings of graphs on surfaces, analytic combinatorics, and finite model theory, and several parts of the proof may be of independent interest. In particular, we identify precisely the properties that make the zero-one law work on planar graphs but fail for every other surface.
CitationAtserias, A., Kreutzer, S., Noy, M. On zero-one and convergence laws for graphs embeddable on a fixed surface. A: International Colloquium on Automata, Languages, and Programming. "45th International Colloquium on Automata, Languages, and Programming (ICALP 2018): July 9-13, 2018, Prague, Czech Republic". Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 1-14.