Logical properties of random graphs from small addable classes

zbMath1475.03085arXiv1707.02081MaRDI QIDQ5227515

Anuj Dawar, Eryk Kopczyński

Publication date: 6 August 2019

Full work available at URL: https://arxiv.org/abs/1707.02081

zbMATH Keywords

first-order logiczero-one lawslimit lawrandom planar graphssmooth addable classes

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Model theory of finite structures (03C13)

Related Items (3)

Logical limit laws for layered permutations and related structures ⋮ Preface to the special issue of Permutation Patterns 2021 (PP2021) ⋮ Axiomatizing Rectangular Grids with no Extra Non-unary Relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic uses of the Feferman-Vaught theorem
• Elements of finite model theory.
• 0-1 laws and decision problems for fragments of second-order logic
• Infinitary logics and 0-1 laws
• MSO zero-one laws on random labelled acyclic graphs
• Logical limit laws for minor-closed classes of graphs
• Random planar graphs
• Generating labeled planar graphs uniformly at random
• Finite Model Theory on Tame Classes of Structures
• Random Graphs from a Minor-Closed Class
• Properties of Almost All Graphs and Generalized Quantifiers
• Probabilities on finite models
• Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture

This page was built for publication: Logical properties of random graphs from small addable classes