Timeline for Polygonal paths and polygons with prescribed set of vertices
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2019 at 21:50 | comment | added | Algirdas Rugys | Nice path, Joseph. So it seems, here are questions for $0 \leq x+y \leq 4$ for path and $0 \leq x+y \leq 6$ for a polygon. | |
| Dec 7, 2019 at 21:26 | comment | added | Dmitri Panov | Me too, I don't see for a while whether such a polygon exists for $n=3$. I would give more than 50% chance that it doesn't. But I have not thought yet how to prove it, just made about 100 unsuccessful pictures... | |
| Dec 7, 2019 at 21:17 | comment | added | Joseph O'Rourke | @AlgirdasRugys: For $n=3$, there is a polygonal path (but maybe not a polygon). I added a figure to my post. | |
| Dec 7, 2019 at 20:53 | comment | added | Algirdas Rugys | Congratulations - nice work :) So - is the n=4 the smallest possible - what about n=3 ? | |
| Dec 7, 2019 at 20:34 | comment | added | Joseph O'Rourke | Nice! And this is a closed cycle, a simple polygon. | |
| Dec 7, 2019 at 20:32 | history | answered | Dmitri Panov | CC BY-SA 4.0 |