The number of possibilities for random dating
Combinatorics
2025-06-26 v1
Abstract
Let be a regular graph and a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of one expects to find in a random subgraph of .
Cite
@article{arxiv.2506.20072,
title = {The number of possibilities for random dating},
author = {Aaron Abrams and Rod Canfield and Andrew Granville},
journal= {arXiv preprint arXiv:2506.20072},
year = {2025}
}
Comments
This is the fifth of eleven old articles being uploaded to arxiv after publication