|
|||||
|
|
The number of possibilities for random dating |
|
| Authors: | Aaron Abrams |
| Affiliation: | a Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA b Department of Computer Science, University of Georgia, Athens, GA 30602, USA c Département de Mathématiques et Statistique, Université de Montréal, CP 6128 succ Centre-Ville, Montréal QC H3C 3J7, Canada |
| 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: | Random graph Subgraphs Hitting time Matchings Hamiltonian cycles |
| 本文献已被 ScienceDirect 等数据库收录！ | |