Timeline for Finding a monochromatic cycle in clique
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 12, 2017 at 18:39 | history | edited | YCor |
edited tags
|
|
| Sep 12, 2017 at 15:44 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Aug 13, 2017 at 15:25 | answer | added | Dan Cranston | timeline score: 2 | |
| S Aug 10, 2017 at 16:02 | history | suggested | Aditya Guha Roy | CC BY-SA 3.0 |
Latexifying and changing s.t to such that
|
| Aug 10, 2017 at 15:52 | review | Suggested edits | |||
| S Aug 10, 2017 at 16:02 | |||||
| Aug 10, 2017 at 9:37 | comment | added | bof | The answer to (2) is $2r+1$ since the arboricity of the complete graph $K_n$ is $\lceil n/2\rceil.$ | |
| Aug 10, 2017 at 9:20 | comment | added | bof | For (1) see R. J. Faudree and R. H. Schelp, All Ramsey numbers for cycles in graphs, Discrete Math. 8 (1974), 313–329 and earlier work referenced therein. | |
| Aug 10, 2017 at 7:36 | review | First posts | |||
| Aug 10, 2017 at 7:37 | |||||
| Aug 10, 2017 at 7:30 | history | asked | rotem brand | CC BY-SA 3.0 |