3 research outputs found
The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
Abstract Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that no line passing through one edge of G meets the relative interior of another edge. We show that in this case the number of edges in G is at most 2n β 3
The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
Abstract Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that no line passing through one edge of G meets the relative interior of another edge. We show that in this case the number of edges in G is at most 2n β 3