Counting Carambolas

Adrian Dumitrescu; Andr\'e Schulz; Csaba D. T\'oth; Maarten L\"offler

REVIEW

Counting Carambolas

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1410.1579 v2 pith:RFKEWJ6S submitted 2014-10-06 math.CO cs.DM

Counting Carambolas

Adrian Dumitrescu , Maarten L\"offler , Andr\'e Schulz , Csaba D. T\'oth This is my paper

classification math.CO cs.DM

keywords emphconfigurationspolygonsboundscarambolasconsiderconvexcounting

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original 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 \emph{convex polygons}, \emph{star-shaped polygons} and \emph{monotone paths}. We also consider related problems for \emph{directed} planar straight-line graphs.

Counting Carambolas

discussion (0)