Regular subgraphs of random graphs
Abstract
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 is also shown that G(n, ρ/n) contains a 3-regular graph with high probability whenever ρ > λ ≈ 5.1494. These are the first constant bounds on the average degree in G(n, p) for the existence of a k-regular subgraph. We also discuss the appearance of 3-regular subgraphs in cores of random graphs. © 2006 Wiley Periodicals, Inc.
Publication Title
Random Structures and Algorithms
Recommended Citation
Bollobás, B., Kim, J., & Verstraëte, J. (2006). Regular subgraphs of random graphs. Random Structures and Algorithms, 29 (1), 1-13. https://doi.org/10.1002/rsa.20123
COinS
