English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Paper

Distribution of Certain Sparse Spanning Subgraphs in Random Graphs

MPS-Authors
/persons/resource/persons44475

Gao,  Pu
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

1105.5913.pdf
(Preprint), 264KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Gao, P. (2011). Distribution of Certain Sparse Spanning Subgraphs in Random Graphs. Retrieved from http://arxiv.org/abs/1105.5913.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0019-D738-4
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 triangle-free subgraphs, of (directed) Hamilton cycles and of spanning subgraphs that are isomorphic to a collection of vertex disjoint (directed) triangles.