Timeline for Forced monochromatic pairs in graphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 12 at 3:56 | comment | added | bof | A complete $n$-partite graph $K_{r_1,r_2,r_3,\dots,r_n}$ where $r_1r_2r_3\cdots r_n\ge2$. | |
| Sep 10 at 17:58 | vote | accept | Dominic van der Zypen | ||
| Sep 10 at 13:59 | comment | added | Ilya Bogdanov | Take an edge-critical graph and remove any edge. | |
| Sep 10 at 10:35 | answer | added | Peter Taylor | timeline score: 3 | |
| Sep 10 at 9:26 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |