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
1 event
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2018 at 3:01 | history | answered | Luca Ghidelli | CC BY-SA 4.0 |