Timeline for Complete minors of the grid graphs $\mathbb{Z}^n$
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2018 at 18:40 | vote | accept | Dominic van der Zypen | ||
| Jun 2, 2018 at 18:39 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
edited body
|
| Jun 2, 2018 at 18:39 | comment | added | Dominic van der Zypen | Right Adam - will correct | |
| Jun 2, 2018 at 17:22 | answer | added | Adam Przeździecki | timeline score: 3 | |
| Jun 2, 2018 at 16:59 | comment | added | Adam Przeździecki | "$m(2)>2$ would allow to construct a counterexample to the $4$-color theorem" -- you meant $m(2)>4$, of course. | |
| Jun 2, 2018 at 16:43 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 65 characters in body
|
| Jun 2, 2018 at 16:42 | comment | added | Dominic van der Zypen | Thanks for your argument! Will put it into the problem statement as remark | |
| Jun 2, 2018 at 15:59 | comment | added | Wojowu | I'm pretty sure $m(2)=4$ (consider minor given by sets $\{(1,1)\},\{(0,0),(0,1),(0,2)\},\{(1,0),(2,0),(2,1)\},\{(1,2),(2,2)\}$) and $m(n)$ is infinite for $n>2$ (by some construction similar to the fact any graph can be embedded in $\mathbb R^3$ without intersections). I will let someone else write up the details. | |
| Jun 2, 2018 at 15:51 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |