0
$\begingroup$

Can we prove that for any simple polygon with more than 3 vertices there always exists a diagonal which:

  • is inside the polygon
  • doesn't intersect with any edges
  • splits the polygon in two polygons in such a way that the difference between their vertex counts is smaller than 2 (e.g. splits a polygon with 29 vertices into polygons with 15 and 16 vertices)?
Improve this question
$\endgroup$

1 Answer 1

Reset to default
2
$\begingroup$

I think the following is a counterexample on six vertices: Start with an equilateral triangle $ABC$ and a larger equilateral triangle $A'B'C'$ with the same center and parallel edges. Now consider the hexagon $AA'BB'CC'$. The only candidates for bisecting diagonals (since we have an even number of vertices) are $AB'$, $BC'$, $CA'$, all of which intersect other edges.

Improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.