随机约会的可能性数量
组合数学
2025-06-26 v1
摘要
设 为一个规则图， 为同一顶点集上的一个子图。我们给出关于在 的随机子图中找到 的拷贝数量的惊人紧凑公式。
引用
@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}
}
备注
This is the fifth of eleven old articles being uploaded to arxiv after publication