A property of triangulation

Revision en2, by cuom1999, 2019-01-11 02:28:39

"In a triangulation of a regular n-gon, there always exists a diagonal that divides the polygon into 2 small polygons and the smaller one has at least vertices."

I saw this property in the NEERC 2014's editorial but still cannot prove it. Can anyone help me? Thank you!

#### History

Revisions

Rev. Lang. By When Δ Comment
en2 cuom1999 2019-01-11 02:28:39 14 Tiny change: ' at least O(n/3) vertices.' -> ' at least $O(\frac{n}{3})$ vertices.' (published)
en1 cuom1999 2019-01-11 02:27:51 306 Initial revision (saved to drafts)