Timeline for Arbitrarily high degree planar covers?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2022 at 18:15 | comment | added | Sprotte | @IlyaBogdanov Thank you. | |
| Oct 19, 2022 at 16:14 | comment | added | Ilya Bogdanov | Embed your favourite 3-connected (planar) graph into an annulus so that it contains a non-contractible cycle. Now you may multiply the degree arbitrarily, taking $n$-fold covers of the annulus by itself. | |
| Oct 19, 2022 at 15:51 | history | asked | Sprotte | CC BY-SA 4.0 |