|
| | | | |
| | | |
| Stat |
Members: 3665
Articles: 2'599'751
Articles rated: 2609
18 January 2025 |
|
| | | | |
|
Article overview
| |
|
|
Sprinkling with random regular graphs | | Mikhail Isaev
; Brendan D. McKay
; Angus Southwell
; Maksim Zhukovskii
; | | Date: |
1 Sep 2023 | | Abstract: | 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 that the combined degree and the
complementary degrees are growing. 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. | | Source: | arXiv, 2309.00190 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER