Random graphs from a weighted minor-closed class
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a more general model. We consider random graphs from a `well-be...
Main Author: | McDiarmid, C |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2012
|
Similar Items
-
Random Graphs from a Minor-Closed Class.
by: McDiarmid, C
Published: (2009) -
On the purity of minor-closed classes of graphs
by: McDiarmid, C, et al.
Published: (2018) -
Connectivity for random graphs from a weighted bridge-addable class
by: McDiarmid, C
Published: (2012) -
On the critical densities of minor-closed classes
by: McDiarmid, C, et al.
Published: (2018) -
Random Graphs Containing Few Disjoint Excluded Minors
by: McDiarmid, C, et al.
Published: (2014)