Timeline for Smallest size for an incomplete tournament with property $S_k$
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2011 at 3:12 | comment | added | Gerhard Paseman | I have a suspicion that f(2,n) <= 4n for n > 8, and that for general k 4 can be replaced by 1 + 3^(k-1) and n >= 3^k. Do you have any more bounds from the literature? Gerhard "Ask Me About System Design" Paseman, 2011.10.22 | |
| Oct 22, 2011 at 13:45 | history | asked | Ewan Delanoy | CC BY-SA 3.0 |