arXiv:1304.3000 [math.CO]AbstractReferencesReviewsResources
Non-Vertex-Balanced Factors in Random Graphs
Stefanie Gerke, Andrew McDowell
Published 2013-04-10Version 1
We prove part of a conjecture by Johansson, Kahn and Vu \cite{JKV} regarding threshold functions for the existence of an $H$-factor in a random graph \gnp. We prove that the conjectured threshold function is correct for any graph $H$ which is not covered by its densest subgraphs. We also demonstrate that the main result of \cite{JKV} generalises to multigraphs, digraphs, and a multipartite model.
Comments: 41 pages. Pre-print. arXiv admin note: text overlap with arXiv:0803.3406 by other authors
Categories: math.CO
Related articles: Most relevant | Search more
Pancyclic subgraphs of random graphs
On a Cohen-Lenstra Heuristic for Jacobians of Random Graphs
arXiv:math/0209087 [math.CO] (Published 2002-09-09)
On the non-3-colourability of random graphs