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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.