The number of possibilities for random dating

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$.

This is the fifth of eleven old articles being uploaded to arxiv after publication