Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
Combinatorics
2012-12-18 v2
Abstract
For any fixed integer we characterise the typical structure of undirected graphs with vertices and maximum degree , as tends to infinity. The information is used to prove that such graphs satisfy a labelled limit law for first-order logic. If then also an unlabelled limit law holds.
Cite
@article{arxiv.1204.2446,
title = {Random graphs with bounded maximum degree: asymptotic structure and a logical limit law},
author = {Vera Koponen},
journal= {arXiv preprint arXiv:1204.2446},
year = {2012}
}