DeepAI
Log In Sign Up

A tight bound for the number of edges of matchstick graphs

09/20/2022
by   Jérémy Lavollée, et al.
0

A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introduced these graphs in 1986 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 Lhuilier's inequality.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/09/2021

Disjoint edges in geometric graphs

A geometric graph is a graph drawn in the plane so that its vertices and...
08/17/2021

Bounding the number of edges of matchstick graphs

We show that a matchstick graph with n vertices has no more than 3n-c√(n...
06/08/2022

The number of small-degree vertices in matchstick graphs

A matchstick graph is a crossing-free unit-distance graph in the plane. ...
10/03/2020

Planar projections of graphs

We introduce and study a new graph representation where vertices are emb...
09/01/2020

Strong Hanani-Tutte for the Torus

If a graph can be drawn on the torus so that every two independent edges...
08/24/2020

Odd wheels are not odd-distance graphs

An odd wheel graph is a graph formed by connecting a new vertex to all v...
09/08/2017

Balanced Line Separators of Unit Disk Graphs

We prove a geometric version of the graph separator theorem for the unit...