Lavollée, Jérémy and Swanepoel, Konrad ORCID: 0000-0002-1668-887X (2024) A tight bound for the number of edges of matchstick graphs. Discrete and Computational Geometry, 72 (4). 1530 - 1544. ISSN 0179-5376
Text (Swanepoel_tight-bound-for-the-number--published)
- Published Version
Available under License Creative Commons Attribution. Download (417kB) |
Identification Number: 10.1007/s00454-023-00530-z
Abstract
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introduced these graphs in 1981 and conjectured that the maximum number of edges for a matchstick graph on n vertices is ⌊3n−√12n-3⌋. In this paper we prove this conjecture for all n≥1. The main geometric ingredient of the proof is an isoperimetric inequality related to L’Huilier’s inequality.
Item Type: | Article |
---|---|
Official URL: | https://www.springer.com/journal/454 |
Additional Information: | © 2023 The Author(s) |
Divisions: | Mathematics |
Subjects: | Q Science > QA Mathematics |
Date Deposited: | 13 Apr 2023 10:57 |
Last Modified: | 02 Dec 2024 20:15 |
URI: | http://eprints.lse.ac.uk/id/eprint/118619 |
Actions (login required)
View Item |