The logic of random regular graphs

DOI10.4310/JOC.2010.V1.N4.A3zbMATH Open1244.05202OpenAlexW2317898122MaRDI QIDQ547871FDOQ547871

Authors: Simi Haber, Michael Krivelevich 

Publication date: 27 June 2011

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2010.v1.n4.a3

Recommendations

• Zero-One Laws for Sparse Random Graphs
• First-order and monadic properties of highly sparse random graphs
• First-order properties of bounded quantifier depth of very sparse random graphs
• Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
• Zero-one \(k\)-law

zbMATH Keywords

first-order propertiesrandom regular graphbinomial random graph modelsparse random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Basic properties of first-order languages and structures (03C07)

Cited In (9)

• The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees
• Theory of Cryptography
• \(\gamma\)-variable first-order logic of uniform attachment random graphs
• MSO 0-1 law for recursive random trees
• Logical limit laws for minor-closed classes of graphs
• Title not available (Why is that?)
• Random graphs as a model for pregeometry
• DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS
• A limit law of almost \(l\)-partite graphs

This page was built for publication: The logic of random regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547871)