benchmarks.wiki / Public workspace

Omni-MATH / Let P be a convex polygon with n sides, n≥3. Any set of n minus 3 diagonals of P that do not intersect in the interior of the polygon determine a [i]triangulation[/i] of P into … · Discussion

Discussing Let P be a convex polygon with n sides, n≥3. Any set of n minus{} 3 diagonals of P that do not intersect in the interior of the polygon determine a [i]triangulation[/i] of P into … · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.