Timeline for An upper bound on diagonal k-colored Ramsey number
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 3, 2017 at 12:25 | history | edited | JIOCb | CC BY-SA 3.0 |
deleted 1 character in body
|
| Jun 2, 2017 at 11:00 | comment | added | Ben Barber | You can get $k^{kn}$ by restricting to the largest coloured neighbourhood of an arbitrary vertex $kn$ times, then doing a second pass to get $n$ vertices where all the forward edges are the same colour. | |
| Jun 1, 2017 at 16:04 | history | edited | JIOCb |
edited tags
|
|
| Jun 1, 2017 at 15:50 | review | First posts | |||
| Jun 1, 2017 at 16:02 | |||||
| Jun 1, 2017 at 15:50 | history | asked | JIOCb | CC BY-SA 3.0 |