Timeline for Is every finite graph an induced minor of $\omega^2$?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 21, 2019 at 16:48 | vote | accept | Dominic van der Zypen | ||
| Jan 21, 2019 at 16:12 | answer | added | Wojowu | timeline score: 6 | |
| Jan 21, 2019 at 15:37 | comment | added | Dominic van der Zypen | Can you put a short argument for your first comment into an answer so we can close this thread? Comment #2 is amazing! Do you have a proof/reference? | |
| S Jan 21, 2019 at 11:27 | history | suggested | LeechLattice | CC BY-SA 4.0 |
correct typo
|
| Jan 21, 2019 at 10:31 | review | Suggested edits | |||
| S Jan 21, 2019 at 11:27 | |||||
| Jan 21, 2019 at 9:35 | comment | added | Wojowu | See here for a proof planar graphs are minors of grids. The construction should be tweakable as to make them induced minors. | |
| Jan 21, 2019 at 9:21 | comment | added | Wojowu | Also, before you ask, every countable graph is an induced minor of $\omega^3$. | |
| Jan 21, 2019 at 9:18 | comment | added | Wojowu | $\omega^2$ is planar, hence so is its every minor. Every planar graph will be a minor, which you can see by approximating a drawing in a suitable way. | |
| Jan 21, 2019 at 8:16 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
deleted 2 characters in body
|
| Jan 21, 2019 at 7:42 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |