Timeline for Are directed graphs with out-degree exactly 2 strongly connected with probability 1?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6 at 11:11 | history | edited | Corentin B | CC BY-SA 4.0 |
added 11 characters in body
|
| Jul 6 at 2:53 | comment | added | Brendan McKay | With similar argument, one can show that there are a linear number of vertices with no incoming edges with high probability. So in fact the probability of being strongly connected goes to 0, quickly. | |
| Jul 4 at 23:26 | vote | accept | JoshuaZ | ||
| Jul 4 at 18:39 | history | edited | Corentin B | CC BY-SA 4.0 |
deleted 56 characters in body
|
| Jul 4 at 18:12 | history | edited | Corentin B | CC BY-SA 4.0 |
deleted 5 characters in body
|
| Jul 4 at 15:46 | history | edited | Corentin B | CC BY-SA 4.0 |
added 87 characters in body
|
| Jul 4 at 15:38 | history | edited | Corentin B | CC BY-SA 4.0 |
added 195 characters in body
|
| Jul 4 at 15:28 | history | edited | Corentin B | CC BY-SA 4.0 |
added 200 characters in body
|
| Jul 4 at 15:09 | history | answered | Corentin B | CC BY-SA 4.0 |