MSO zero-one laws on random labelled acyclic graphs
From MaRDI portal
Publication:1613549
DOI10.1016/S0012-365X(01)00375-2zbMath1011.03022MaRDI QIDQ1613549
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13)
Related Items (8)
\( \gamma \)-variable first-order logic of preferential attachment random graphs ⋮ Logical properties of random graphs from small addable classes ⋮ On the structure of random unlabelled acyclic graphs. ⋮ Logical limit laws for minor-closed classes of graphs ⋮ On the convergence of probabilities of first-order sentences for recursive random graph models ⋮ MSO 0-1 law for recursive random trees ⋮ The first order convergence law fails for random perfect graphs ⋮ \(\gamma\)-variable first-order logic of uniform attachment random graphs
This page was built for publication: MSO zero-one laws on random labelled acyclic graphs
