Timeline for Is there a version of Robertson-Seymour's graph minor theorem for odd minors?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 14, 2017 at 14:49 | answer | added | Tony Huynh | timeline score: 1 | |
| Aug 9, 2017 at 2:56 | comment | added | Sang-il | I am pretty sure that the well-quasi-ordering result of binary matroids would imply the well-quasi-ordering of graphs under odd minors. I also remember hearing Tony Huynh talking on structure of "group-labelled" graphs with a forbidden minors. Perhaps, though not everything is published, it must be known. | |
| Aug 8, 2017 at 18:11 | review | First posts | |||
| Aug 8, 2017 at 18:27 | |||||
| Aug 8, 2017 at 18:11 | history | asked | Dan Cranston | CC BY-SA 3.0 |