Asymptotic probabilities of extension properties and random \(l\)-colourable structures

DOI10.1016/j.apal.2011.12.001zbMath1257.03057arXiv1204.2460OpenAlexW2592336120MaRDI QIDQ764265

Vera Koponen

Publication date: 13 March 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

colouringhereditary propertyzero-one lawpregeometryfinite model theoryamalgamation propertyasymptotic probabilityextension axiomsforbidden structures

Mathematics Subject Classification ID

Combinatorial probability (60C05) Zero-one laws (60F20) Model theory of finite structures (03C13) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (7)

On sets with rank one in simple homogeneous structures ⋮ Random ℓ‐colourable structures with a pregeometry ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS ⋮ Limit laws and automorphism groups of random nonrigid structures ⋮ A Limit Law of Almost l-partite Graphs ⋮ Simple structures axiomatized by almost sure theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The fine structure of octahedron-free graphs
• The structure of almost all graphs in a hereditary property
• Upper and lower bounds for first order expressibility
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• \(\aleph_0\)-categorical structures with a predimension
• The finite submodel property and \(\omega\)-categorical expansions of pregeometries
• Combinatorial theory.
• The typical structure of graphs without given excluded subgraphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Probabilities on finite models
• Random I‐colorable graphs
• Deux ou trois choses que je sais de L_n
• Paths in graphs
• On first-order sentences without finite models
• Countable homogeneous relational structures and ℵ₀-categorical theories
• Approximation and Online Algorithms
• 25 pretty graph colouring problems
• Asymptotic enumeration, global structure, and constrained evolution

This page was built for publication: Asymptotic probabilities of extension properties and random \(l\)-colourable structures