Timeline for Asymptotics of list size in Robertson-Seymour theorem
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Jan 14, 2016 at 15:51 | vote | accept | CommunityBot | ||
| Jan 14, 2016 at 15:43 | comment | added | Tony Huynh | As Eppstein mentions, if you take a graph which consists of exactly $g+1$ blocks, each of which is a $K_5$ or a $K_{3,3}$, then this will be an excluded minor for embedding in a surface of genus $g$. There are obviously at least $2^{g+1}$ such graphs. | |
| Jan 14, 2016 at 14:21 | comment | added | user76479 | i dont see a reference for 'at least'. | |
| Jan 13, 2016 at 21:39 | history | answered | Tony Huynh | CC BY-SA 3.0 |