The number of possibilities for random dating
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915358196105216 |
|---|---|
| author | Abrams, Aaron Canfield, Rod Granville, Andrew |
| author_facet | Abrams, Aaron Canfield, Rod Granville, Andrew |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_20072 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The number of possibilities for random dating Abrams, Aaron Canfield, Rod Granville, Andrew Combinatorics 05C30 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$. |
| title | The number of possibilities for random dating |
| topic | Combinatorics 05C30 |
| url | https://arxiv.org/abs/2506.20072 |