Sciweavers

RSA
2006
80views more  RSA 2006»
13 years 4 months ago
Regular subgraphs of random graphs
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
Béla Bollobás, Jeong Han Kim, Jacque...