On some extremal problems in discrete geometry and applications of extremal graphs
DOI:
https://doi.org/10.5564/jimdt.v6i1.3761Keywords:
Polygon, discrete geometry, extremal graph, Turan’s graph, clique, partite graphAbstract
Introducing the notions of distant pairs of vertices and big subtriangles of a polygon, and using extremal graph theory—specifically, Tutan's graph—we establish upper bounds for:
- the sum of distances between all distant pairs of vertices in polygons with unit perimeter, and
- the sum of areas of all big subtriangles in convex polygons with unit area.
We also formulate a conjecture on the upper bound of the sum of the areas of all subtriangles in a convex polygon.
Author correction updated dated on 2025-10-21
Downloads
209
References
[1] IMO, "International Mathematical Olympiad, Problems and Solutions, 1959-2009," From:hengsokha.files.wordpress.com.
[2] C. Audet, P. Hansen, and F. Messine, "Extremal problems for convex polygons," Journal of Global Optimization, vol. 38, 2007, pp. 163-179. https://doi.org/10.1007/s10898-006-9065-5
[3] G. Larcher and F. Pillichshammer, "The sum of Distances between Vertices of a Convex
Polygon with unit Perimeter,"The American Mathematical Monthly, 115(4), 2008, pp. 350-355. https://doi.org/10.1080/00029890.2008.11920535
[4] U. Ninjbat, B. Gombodor, and P. Damba, "In the Land of Convex Polygons,"Resonance, vol. 24, 2019, pp. 583-595. https://doi.org/10.1007/s12045-019-0812-6
[5] P. Turan, "On an extremal problem in graph theory," Matematikai es Fizikai Lapok (in Hungarian), vol. 48, 1941, pp. 436-452.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Gonchigdorzh Radnaasumberel

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The authors grant the Journal of Institute of Mathemathics and Digital Technology a license to publish the article and identify itself as the original publisher.
![]()
Articles in the Journal of Institute of Mathemathics and Digital Technology are Open Access articles published under a Creative Commons Attribution-NonCommercial 4.0 International License - CC BY NC.
This license permits NonComericial use, distribution and reproduction in any medium, provided the original work is properly cited.