Random graphs from a block class
Authors:
- Colin McDiarmidCMColin McDiarmid
- Alex ScottASAlex Scott
Preprint
Abstract
A block class is a class of graphs such that a graph is in the class if and only if each of its blocks is. We show that, as for trees, for most random n-vertex graphs in such a class, each vertex is in at most (1+o(1))log n/ log log n blocks, and each path passes through at most 5(n log n)^{1/2} blocks. Further, these results remain true when we condition on the numbers of components and blocks, and on the list of blocks appearing; and if there are at most k blocks (where k=k(n) tends to infinity) we may replace n by k to obtain improved bounds.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- On the connectivity of random graphs from addable classesJournal of Combinatorial Theory, Series B, 2013
- Connectivity for Bridge-Addable Monotone Graph ClassesCombinatorics, Probability and Computing, 2012
- Asymptotic Study of Subcritical Graph ClassesSIAM Journal on Discrete Mathematics, 2011
- The Degree Sequence of Random Graphs from Subcritical ClassesCombinatorics, Probability and Computing, 2009
- Random Graphs from a Minor-Closed ClassCombinatorics, Probability and Computing, 2009
- Graph classes with given 3-connected components: asymptotic counting and critical phenomenaElectronic Notes in Discrete Mathematics, 2007
- Random planar graphsJournal of Combinatorial Theory, Series B, 2005
- A Course in Combinatorics2001
- The maximum degree in a random tree and related problemsRandom Structures & Algorithms, 1994
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982