Title of article
The number of possibilities for random dating
Author/Authors
Abrams، نويسنده , , Aaron and Canfield، نويسنده , , Rod and Granville، نويسنده , , Andrew، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
1265
To page
1271
Abstract
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.
Keywords
subgraphs , Hitting time , Random graph , Hamiltonian cycles , Matchings
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series A
Record number
1531334
Link To Document