Timeline for Awfully sophisticated proof for simple facts
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 28, 2013 at 23:33 | comment | added | András Salamon | Although I like the example, I'm not sure I follow your argument. For the case of forests we already know the finite set of forbidden minors: $\{C_3\}$. So Robertson-Seymour doesn't really enter the picture except via the $O(n^3)$ test, which is really a different theorem. | |
| Nov 9, 2012 at 8:45 | history | answered | Pål GD | CC BY-SA 3.0 |