Sprinkling with random regular graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929437638918144 |
|---|---|
| author | Isaev, Mikhail McKay, Brendan D. Southwell, Angus Zhukovskii, Maksim |
| author_facet | Isaev, Mikhail McKay, Brendan D. Southwell, Angus Zhukovskii, Maksim |
| contents | We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices tends to infinity. We verify this conjecture for the cases when the graphs are sufficiently dense or sparse. We also prove an asymptotic formula for the expected number of spanning regular subgraphs in a random regular graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_00190 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Sprinkling with random regular graphs Isaev, Mikhail McKay, Brendan D. Southwell, Angus Zhukovskii, Maksim Combinatorics 05C80 We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices tends to infinity. We verify this conjecture for the cases when the graphs are sufficiently dense or sparse. We also prove an asymptotic formula for the expected number of spanning regular subgraphs in a random regular graph. |
| title | Sprinkling with random regular graphs |
| topic | Combinatorics 05C80 |
| url | https://arxiv.org/abs/2309.00190 |