Aaron Abrams, Rod Canfield, Andrew Granville·2025-06-25·via math.CO updates on arXiv.org
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$.