137 search results - page 2 / 28 » Critical Subgraphs of a Random Graph |
RSA
2011
13 years 6 days ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
RSA
2011
13 years 6 days ago
2011
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
EJC
2006
13 years 5 months ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
JCT
2008
13 years 5 months ago
2008
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
RSA
2011
13 years 6 days ago
2011
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...