A Limit Law of Almost l-partite Graphs

DOI10.2178/jsl.7803110zbMath1325.03033arXiv1204.2454OpenAlexW2018305354MaRDI QIDQ2869907

Vera Koponen

Publication date: 7 January 2014

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

random graphfinite model theoryforbidden subgraphlimit lawextension properties

Mathematics Subject Classification ID

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

Related Items (1)

DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS

Cites Work

• The logic of random regular graphs
• The fine structure of octahedron-free graphs
• Asymptotic probabilities of extension properties and random \(l\)-colourable structures
• A logical approach to asymptotic combinatorics I. First order properties
• The computational complexity of asymptotic problems. I: Partial orders
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• The typical structure of graphs without given excluded subgraphs
• Extremal Graph Problems for Graphs with a Color-Critical Vertex
• Convergence law for random graphs with specified degree sequence
• The strange logic of random graphs

This page was built for publication: A Limit Law of Almost l-partite Graphs