Timeline for Extensions of Ramsey's theorem: monochromatic but diverse
Current License: CC BY-SA 2.5
3 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 28, 2010 at 11:20 | history | bounty ended | Jukka Suomela | ||
Dec 24, 2010 at 7:54 | comment | added | Hsien-Chih Chang 張顯之 | This is clever! And we only need $n > (k-1)d$ in fact. Your answer rules out almost all the cases... Now the only possibilities are $n \leq (k-1)d$, which are not too much. | |
Dec 24, 2010 at 7:35 | history | answered | domotorp | CC BY-SA 2.5 |