Timeline for Good, simple examples of induction?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2016 at 12:10 | comment | added | Joseph O'Rourke | @RosieF: In this case a triangulation is a maximal set of noncrossing interior diagonals connecting pairs of vertices. | |
| Jul 23, 2016 at 18:37 | comment | added | Rosie F | (2) is wrong as it stands. Suppose that the polygon is a triangle, and its triangulation is $K_4$. Perhaps the theorem is intended to apply to a graph only if it is planar and it is a cycle and some chords of that cycle? That is, a polygon triangulation without extra vertices? | |
| May 27, 2014 at 23:49 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |