Log In

Counting Carambolas

Files

s00373-015-1621-7.pdf (840.91 KB)

Publication date

2015

Authors

Dumitrescu, Adrian
Löffler, MaartenISNI 000000039666142X
Schulz, André
Tóth, Csaba

Editors

Advisors

Supervisors

DOI

https://doi.org/10.1007/s00373-015-1621-7

Document Type

Article

Metadata

Show full item record

Collections

Utrecht University Repository
Open Access logo

License

taverne

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 n points in the plane. Configurations of interest include convex polygons, star-shaped polygons and monotone paths. We also consider related problems for directed planar straight-line graphs.

Keywords

CG, GRAPH, Taverne

Citation

Dumitrescu, A, Löffler, M, Schulz, A & Tóth, C 2015, 'Counting Carambolas', Graphs and Combinatorics, vol. 32, no. 3, pp. 923-942. https://doi.org/10.1007/s00373-015-1621-7

URI

https://dspace.library.uu.nl/handle/1874/464701