Diameter graphs of polygons and the proof of a conjecture of Graham

DOI10.1016/j.jcta.2007.02.006zbMath1136.52004OpenAlexW1982568170WikidataQ59650406 ScholiaQ59650406MaRDI QIDQ2459503

Tamás T. Szabó, James A. Foster

Publication date: 7 November 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2007.02.006

zbMATH Keywords

discrete geometrydiameter graphReuleaux polygonsextremal polygonsisodiametric theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Inequalities and extremum problems involving convexity in convex geometry (52A40) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (8)

Numerical certification of Pareto optimality for biobjective nonlinear problems ⋮ Finding largest small polygons with gloptipoly ⋮ Small polygons with large area ⋮ Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons ⋮ The small hexagon and heptagon with maximum sum of distances between vertices ⋮ Largest small polygons: a sequential convex optimization approach ⋮ Enumerating isodiametric and isoperimetric polygons ⋮ Using symbolic calculations to determine largest small polygons

Cites Work

• Unnamed Item
• Isoperimetric ratios of Reuleaux polygons
• The largest small hexagon
• The largest small octagon
• Isodiametric problems for polygons
• Der zentralsymmetrische Kern und die zentralsymmetrische Hülle von konvexen Körpern
• A $1 Problem

This page was built for publication: Diameter graphs of polygons and the proof of a conjecture of Graham