On geometric graphs with no two edges in convex position
type: Item
instance of: scholarly article
title: On geometric graphs with no two edges in convex position
zbMATH Open document ID: 0908.05033
DOI: 10.1007/PL00009357
published in: Discrete \& Computational Geometry
publication date: 1998-06-08T00:00:00Z
review text: A geometric graph is a graph \(G= (V,E)\) drawn in the plane, whose vertex set is represented by points in general position and whose edges are represented by straight segments. Two edges of a geometric graph are in convex position if they are disjoint edges of a convex quadrilateral. The main result states that a geometric graph with \(n\) vertices and no pair of edges in convex position contains at most \(2n-1\) edges.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 1160549
zbMATH Keywords: planar drawing
zbMATH Keywords: geometric graph
zbMATH Keywords: convex position
author: Meir Katchalski
author: Hagit Last
reviewed by: Stelian Mihalas
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1160549