Abstract
Let G n,d be a random d-regular graph with n vertices, where d = o(n). Given a fixed graph H, Y H denotes the number of induced copies of H in G n,d . In this paper, the authors determine the threshold of the event “Y H > 0”, and also obtain the induced subgraph counts inside the threshold interval.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. H. Kim, B. Sudakov, and V. Vu, Small subgraphs of random regular graphs, Discrete Math., 2007, 307(15): 1961–1967.
B. McKay and N. Wormald, Uniform generation of random regular graphs of moderate degree, J. Algorithm, 1990, 11(1): 52–67.
B. McKay and N. Wormald, Asymptotic enumeration by degree sequence of graphs with degrees o(n 1/2), Ars Combinatoria, 1991, 11(4): 369–382.
S. Janson, T. Łuczak, and A. Ruciński, Random Graphs, Wiely, New York, 2000.
B. Bollobás, Random Graphs, Academic Press, London, 1985.
Z. Gao and N. C. Wormald, Distribution of subgraphs of random regular graphs, Random Structures and Algorithms, 2008, 32(1): 38–48.
N. Wormald, Models of random regular graphs, in Surveys in Combinatorics, London Mathematical Society Lecture Note Series (ed. by J. D. Lamb and D. A. Preece), 1999, Cambridge University Press, Cambridge, 1999, 239–298.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is supported by the National Natural Science of Foundation under Grant Nos. 10531070 and 10721101 of China.
Rights and permissions
About this article
Cite this article
XIAO, L., YAN, G., WU, Y. et al. Induced Subgraph in Random Regular Graph. J Syst Sci Complex 21, 645–650 (2008). https://doi.org/10.1007/s11424-008-9141-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-008-9141-7