The number of possibilities for random dating

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:115

Article

Abrams, Aaron¹  Canfield, Rod²  Granville, Andrew³ 

[1] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA

[2] Univ Georgia, Dept Comp Sci, Athens, GA 30602 USA

[3] Univ Montreal, Dept Math & Stat, Montreal, PQ H3C 3J7, Canada

关键词: random graph;    subgraphs;    hitting time;    matchings;    Hamiltonian cycles;   

DOI  :  10.1016/j.jcta.2007.11.007

来源: Elsevier

【 摘 要 】

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. (C) 2008 Elsevier Inc. All rights reserved.

【 授权许可】

Free