Thesis icon

Thesis

Connectivity and related properties for graph classes

Abstract:

There has been much recent interest in random graphs sampled uniformly from the set of (labelled) graphs on n vertices in a suitably structured class A. An important and well-studied example of such a suitable structure is bridge-addability, introduced in 2005 by McDiarmid et al. in the course of studying random planar graphs. A class A is bridge-addable when the following holds: if we take any graph G in A and any pair u,v of vertices that are in different components in G, then the graph ...

Expand abstract

Actions


Authors


More by this author
Institution:
University of Oxford
Research group:
Combinatorics Group
Oxford college:
New College
Department:
Mathematical,Physical & Life Sciences Division - Statistics
Role:
Author

Contributors

Role:
Supervisor
Publication date:
2014
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
Oxford University, UK
URN:
uuid:667a139e-6d2c-4f67-8487-04c3a0136226
Local pid:
ora:8267
Language:
English
Keywords:
Subjects:

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP