Distributions of sparse spanning subgraphs in random graphs
Abstract
We describe a general approach of determining the distribution of spanning subgraphs in the random graph $\G(n,p)$. In particular, we determine the distribution of spanning subgraphs of certain given degree sequences, which is a generalisation of the $d$factors, of spanning trianglefree subgraphs, of (directed) Hamilton cycles and of spanning subgraphs that are isomorphic to a collection of vertex disjoint (directed) triangles.
 Publication:

arXiv eprints
 Pub Date:
 May 2011
 DOI:
 10.48550/arXiv.1105.5913
 arXiv:
 arXiv:1105.5913
 Bibcode:
 2011arXiv1105.5913G
 Keywords:

 Mathematics  Combinatorics
 EPrint:
 17 pages, 2 figures