Timeline for The effects of collapsing vs joining non-adjacent vertices on the chromatic number
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2020 at 7:23 | comment | added | Dominic van der Zypen | Beautiful example, thanks @TonyHuynh! | |
| May 20, 2020 at 7:22 | vote | accept | Dominic van der Zypen | ||
| May 20, 2020 at 6:09 | comment | added | Tony Huynh | @AndreasBlass Indeed. We can even allow $N_G(v)$ and $N_G(w)$ to intersect if we like. Most values of $|N_G(v)|, |N_G(w)|$, and $|N_G(v) \cap N_G(w)|$ will give valid examples (this is basically a list colouring problem on $v$ and $w$). | |
| May 19, 2020 at 16:25 | comment | added | Andreas Blass | Here $50$ can be treated as a variable, whose smallest value seems to be $2$. Bigger values of $50$ have the advantage that you can add quite a few edges without increasing the chromatic number. | |
| May 19, 2020 at 15:22 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 19 characters in body
|
| May 19, 2020 at 15:07 | history | undeleted | Tony Huynh | ||
| May 19, 2020 at 15:07 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 52 characters in body
|
| May 19, 2020 at 8:18 | history | deleted | Tony Huynh | via Vote | |
| May 19, 2020 at 8:17 | history | answered | Tony Huynh | CC BY-SA 4.0 |