Timeline for expected length of a largest cycle in regular graph
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 19, 2018 at 1:06 | comment | added | j.c. | @BrendanMcKay Thanks! I'll see if I can work it out when I have some time. | |
| Apr 19, 2018 at 1:01 | history | edited | j.c. | CC BY-SA 3.0 |
update with new figure using McKay's computation
|
| Apr 19, 2018 at 0:39 | comment | added | Brendan McKay | The probability that $C_n=n$ is $(1+o(1)) \sqrt{\pi/(4n)}\,e^{3/4}$. Proof as in my "answer". | |
| Apr 18, 2018 at 0:52 | history | edited | j.c. | CC BY-SA 3.0 |
labeled graphs
|
| Apr 18, 2018 at 0:44 | history | answered | j.c. | CC BY-SA 3.0 |