Timeline for The minimum number of Hamiltonian paths in a strongly connected tournament of order $n$
Current License: CC BY-SA 3.0
20 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Mar 20, 2016 at 9:31 | vote | accept | bof | ||
| Mar 20, 2016 at 5:51 | answer | added | Fedor Petrov | timeline score: 4 | |
| Mar 19, 2016 at 23:31 | comment | added | Gordon Royle | The link to the freely available paper is combinatorics.org/ojs/index.php/eljc/article/view/v13i1n3. I am surprised such precise results are known. | |
| Mar 19, 2016 at 19:54 | comment | added | Fedor Petrov | The answer is about $5^{n/3}$. Reference: A note on the number of hamiltonian paths in strong tournaments, Arthur H. Busch. | |
| Mar 19, 2016 at 16:05 | history | edited | bof | CC BY-SA 3.0 |
added 51 characters in body
|
| Mar 19, 2016 at 15:58 | history | edited | bof | CC BY-SA 3.0 |
added 1 character in body
|
| Mar 19, 2016 at 8:17 | history | edited | bof | CC BY-SA 3.0 |
deleted 4 characters in body
|
| Mar 19, 2016 at 8:12 | history | edited | bof | CC BY-SA 3.0 |
added 9 characters in body
|
| Mar 19, 2016 at 8:04 | history | edited | bof | CC BY-SA 3.0 |
added 9 characters in body
|
| Mar 19, 2016 at 7:59 | history | edited | bof | CC BY-SA 3.0 |
added 9 characters in body
|
| Mar 19, 2016 at 7:52 | history | edited | bof | CC BY-SA 3.0 |
added 220 characters in body
|
| Mar 19, 2016 at 7:44 | history | edited | bof | CC BY-SA 3.0 |
added 220 characters in body
|
| Mar 19, 2016 at 7:40 | history | undeleted | bof | ||
| Mar 19, 2016 at 7:40 | history | deleted | bof | via Vote | |
| Mar 19, 2016 at 7:37 | history | undeleted | bof | ||
| Mar 19, 2016 at 7:37 | history | deleted | bof | via Vote | |
| Mar 19, 2016 at 7:37 | history | undeleted | bof | ||
| Mar 19, 2016 at 7:36 | history | deleted | bof | via Vote | |
| Mar 19, 2016 at 7:36 | history | asked | bof | CC BY-SA 3.0 |