DeepAI AI Chat
Log In Sign Up

Disjoint edges in geometric graphs

by   Nikita Chernega, et al.

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called convex if it lies outside of the convex hull of its neighbors. We show that for a geometric graph with n vertices and e edges there are at least n/22e/n3 pairs of disjoint edges provided that 2e≥ n and all the vertices of the graph are convex. Besides, we prove that if any edge of a geometric graph with n vertices is disjoint from at most m edges, then the number of edges of this graph does not exceed n(√(1+8m)+3)/4 provided that n is sufficiently large. These two results are tight for an infinite family of graphs.


page 1

page 2

page 3

page 4


Counting the Number of Crossings in Geometric Graphs

A geometric graph is a graph whose vertices are points in general positi...

A tight bound for the number of edges of matchstick graphs

A matchstick graph is a plane graph with edges drawn as unit-distance li...

Crossing and intersecting families of geometric graphs on point sets

Let S be a set of n points in the plane in general position. Two line se...

Plane augmentation of plane graphs to meet parity constraints

A plane topological graph G=(V,E) is a graph drawn in the plane whose ve...

Caterpillars and alternating paths

Let p(m) (respectively, q(m)) be the maximum number k such that any tree...

Reconstruction of the Path Graph

Let P be a set of n ≥ 5 points in convex position in the plane. The path...

The well-separated pair decomposition for balls

Given a real number t>1, a geometric t-spanner is a geometric graph for ...