Timeline for A direct proof that every $r$-colored complete graph on $n=(r+1)m-(r-1)$ vertices has a monochromatic matching of size $m$?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 10, 2018 at 14:44 | vote | accept | Louis D | ||
| May 9, 2018 at 14:53 | answer | added | Fedor Petrov | timeline score: 4 | |
| May 6, 2018 at 3:01 | answer | added | Luca Ghidelli | timeline score: 1 | |
| May 4, 2018 at 19:53 | comment | added | Bonbon | Got it, I misunderstood the word "match". | |
| May 4, 2018 at 17:58 | comment | added | Louis D | Sorry for the lack of details. I just edited my question to make that step more clear. | |
| May 4, 2018 at 17:57 | history | edited | Louis D | CC BY-SA 4.0 |
added 293 characters in body
|
| May 4, 2018 at 15:57 | comment | added | Bonbon | Sorry, but what do you mean in Proof for r=2, " we can apply induction on the remaining n−3 vertices"? I can't see why this induce proven. | |
| May 4, 2018 at 14:40 | history | asked | Louis D | CC BY-SA 4.0 |