Title of article :
The number of possibilities for random dating
Author/Authors :
Abrams، نويسنده , , Aaron and Canfield، نويسنده , , Rod and Granville، نويسنده , , Andrew، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
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
Journal title :
Journal of Combinatorial Theory Series A
