On the structure of random unlabelled acyclic graphs.

DOI10.1016/S0012-365X(03)00156-0zbMath1045.03035OpenAlexW2169942408MaRDI QIDQ1426116

Gregory Loren McColm

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00156-0

zbMATH Keywords

monadic second-order logicrandom treescolored partitions of integerssubtrees of random treesunlabelled zero-one laws

Mathematics Subject Classification ID

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

Cites Work

• Asymptotic fringe distributions for general families of random trees
• A Ramseyian theorem on products of trees
• The monadic second order theory of all countable ordinals
• Colored partitions and a generalization of the braid arrangement
• MSO zero-one laws on random labelled acyclic graphs
• Sufficient conditions for zero-one laws
• Application of model theoretic games to discrete linear orders and finite automata
• Coloring rules for finite trees, and probabilities of monadic second order sentences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the structure of random unlabelled acyclic graphs.