Timeline for Generalisation of Kuratowski's theorem
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 14, 2018 at 6:54 | comment | added | Emil Jeřábek | I don't see how you can reduce to a graph with countably many vertices and edges. For example, let us start with the graph consisting of vertices $a$, $b$, and continuum many degree-2 vertices connected to $a$ and $b$. How does the reduction proceed? | |
| Apr 13, 2018 at 20:11 | history | edited | Piotr Hajlasz | CC BY-SA 3.0 |
Added links and coordinates of the paper.
|
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Dec 28, 2015 at 2:33 | comment | added | user81529 | Thanks, I'm not very comfortable with geometry, but reading the paper does clear some of my doubts. I'll accept this answer for now. (: | |
| Dec 28, 2015 at 2:32 | vote | accept | CommunityBot | ||
| Dec 27, 2015 at 20:39 | vote | accept | CommunityBot | ||
| Dec 27, 2015 at 20:39 | |||||
| Dec 27, 2015 at 14:59 | comment | added | Igor Rivin | @GuoXianYau see the edit... | |
| Dec 27, 2015 at 14:59 | history | edited | Igor Rivin | CC BY-SA 3.0 |
added argument outline
|
| Dec 27, 2015 at 2:46 | comment | added | user81529 | It is the backward direction that I have problem with. Suppose the three condition holds, is there a pure graph theoretic reasoning to prove that the graph has to be planar? I have read the paper mentioned in the other post about two months ago but it is a bit too technical in some parts of it. | |
| Dec 26, 2015 at 22:31 | history | answered | Igor Rivin | CC BY-SA 3.0 |