New Properties of Numbers of Plane Graphs
From MaRDI portal
Abstract: We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with edges to the number of graphs with edges. We show how a relatively small improvement of this bound would improve existing bounds concerning numbers of plane graphs with a prescribed number of edges. Furthermore, we use a cross-graph charging scheme to derive lower bounds for the number of such graphs when the point set has few extreme points.
This page was built for publication: New Properties of Numbers of Plane Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6285358)
