Timeline for For a round-robin tournament, what is the favorite's least favorite size?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 17:58 | comment | added | I am not Paul Erdos | I also changed the tiebreak to "the favorite always wins a tiebreak". | |
| Apr 13, 2017 at 17:53 | history | edited | I am not Paul Erdos | CC BY-SA 3.0 |
sb(n,l,b) definition
|
| Apr 13, 2017 at 17:47 | comment | added | I am not Paul Erdos | I didn't expressed myself well: the combinatorial argument that gives this formula is simple, but the analysis is hard. | |
| Apr 13, 2017 at 17:33 | comment | added | Timothy Chow | I'm O.K. with your tiebreak rule (which can be phrased as, "the favorite always loses a tiebreak"), but I don't see how this makes the question I asked "much easier." Can you even prove from your formula that $\lim_{\epsilon\to0} N(\epsilon) = \infty$? | |
| Apr 13, 2017 at 8:24 | history | edited | I am not Paul Erdos | CC BY-SA 3.0 |
improved formatting
|
| Apr 13, 2017 at 8:03 | history | answered | I am not Paul Erdos | CC BY-SA 3.0 |