| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656097 | Journal of Combinatorial Theory, Series A | 2008 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
