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

Paper

Similar papers

© 2026 NYSGPT2525 LLC