Counting carambolas
From MaRDI portal
Abstract: We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of points in the plane. Configurations of interest include emph{convex polygons}, emph{star-shaped polygons} and emph{monotone paths}. We also consider related problems for emph{directed} planar straight-line graphs.
Recommendations
Cites work
- Bounds on the maximum multiplicity of some common geometric graphs
- Computational geometry. Algorithms and applications.
- Convex polygons in geometric triangulations
- Counting carambolas
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Crossing-Free Subgraphs
- Flipping edges in triangulations
- How many potatoes are in a mesh?
- Matrix Analysis
- Monotone paths in planar convex subdivisions and polytopes
- On the Number of Cycles in Planar Graphs
- On the number of plane geometric graphs
- On the number of spanning trees a planar graph can have
Cited in
(5)
This page was built for publication: Counting carambolas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293619)