Timeline for Tournament contained in vertex transitive tournament
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 1, 2019 at 11:35 | comment | added | Emil Jeřábek | In this construction, you can take $N=O(n^2)$, see e.g. en.wikipedia.org/wiki/… . | |
| May 1, 2019 at 2:38 | history | edited | Brendan McKay | CC BY-SA 4.0 |
added 16 characters in body
|
| Apr 30, 2019 at 21:53 | comment | added | bof | I don't know anything about uncountable tournaments, but your construction seems to work fine in the countable case. In fact there is one vertex-transitive countable tournament which contains a copy of every countable tournament. Namely, the random countable tournament contains a copy of every countable tournament, so it suffices to embed the random tournament in an "infinite cyclic tournament". | |
| Apr 30, 2019 at 11:45 | history | edited | Brendan McKay | CC BY-SA 4.0 |
added 49 characters in body
|
| Apr 30, 2019 at 8:23 | comment | added | Andreas Thom | My answer is also about finite tournaments, but it asks for more, namely the property that all partially defined automorphisms can be extended. The resulting tournament would be also edge-transitive etc. | |
| Apr 30, 2019 at 6:55 | history | answered | Brendan McKay | CC BY-SA 4.0 |