The number of possibilities for random dating

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.

• Type: Journal
• Year: 2008
• Where: JCT
• Authors: Aaron Abrams, Rod Canfield, Andrew Granville
• Keywords: Compact Formulas, JCT 2008, Regular Graph