Timeline for The properties of almost all directed graphs
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 30, 2019 at 14:22 | comment | added | Joseph O'Rourke | Just one result, so not an answer to your question: Almost every $r$-regular digraph is Hamiltonian for $r \ge 3$. Cooper, Colin, Alan Frieze, and Michael Molloy. "Hamilton cycles in random regular digraphs." Combinatorics, Probability and Computing 3, no. 1 (1994): 39-49. | |
| Jul 30, 2019 at 14:10 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
added examples for the case of simple graphs
|
| Jul 30, 2019 at 6:33 | history | edited | Aidan Rocke |
added reference tag
|
|
| Jul 30, 2019 at 6:16 | history | edited | Aidan Rocke |
edited tags
|
|
| Jul 30, 2019 at 5:43 | history | edited | Aidan Rocke | CC BY-SA 4.0 |
added a qualifier for the type of book I'm looking for
|
| Jul 30, 2019 at 5:28 | history | asked | Aidan Rocke | CC BY-SA 4.0 |