Timeline for Minimum number of common edges of triangulations
Current License: CC BY-SA 4.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 3, 2023 at 6:50 | history | bounty ended | Till | ||
| S Oct 3, 2023 at 6:50 | history | notice removed | Till | ||
| Oct 2, 2023 at 3:19 | answer | added | Tony Huynh | timeline score: 5 | |
| Oct 1, 2023 at 15:22 | history | edited | Till | CC BY-SA 4.0 |
Clarified that the convex hull should be triangular.
|
| Oct 1, 2023 at 8:54 | answer | added | Brendan McKay | timeline score: 4 | |
| Oct 1, 2023 at 0:34 | comment | added | Gerry Myerson | $f(7)\le6$. Let the convex hull be a hexagon. Join the interior vertex to every alternate exterior vertex, in two different ways, then triangulate the three resulting quadrilaterals without using the interior vertex. | |
| Sep 30, 2023 at 22:16 | answer | added | Jukka Kohonen | timeline score: 7 | |
| Sep 30, 2023 at 18:23 | answer | added | Alex Ravsky | timeline score: 6 | |
| Sep 30, 2023 at 17:28 | comment | added | Jukka Kohonen | Wlod, "[point sets] [in the plane] [of size n]". | |
| Sep 30, 2023 at 16:17 | comment | added | Wlod AA | What is the "plane of size n"? | |
| Sep 30, 2023 at 16:07 | history | edited | Alex Ravsky |
edited tags
|
|
| S Sep 30, 2023 at 10:21 | history | bounty started | Till | ||
| S Sep 30, 2023 at 10:21 | history | notice added | Till | Draw attention | |
| Sep 23, 2023 at 21:07 | comment | added | Joseph O'Rourke | What do you know about small $n$? | |
| Sep 12, 2023 at 8:17 | comment | added | Brendan McKay | Ok, I see $f(9)\le 8$. Nice problem. | |
| Sep 12, 2023 at 7:43 | comment | added | Brendan McKay | I assume $f(n)$ includes the convex hull edges. $f(n)\le n$ is easy; can you give an example showing $f(n)<n$? | |
| Sep 12, 2023 at 7:27 | history | asked | Till | CC BY-SA 4.0 |