On weighted sums of numbers of convex polygons in point sets

DOI10.1007/s00454-022-00395-8zbMath1498.52027arXiv1910.08736OpenAlexW2980700979MaRDI QIDQ2167313

Ferran Torra, Pablo Pérez-Lantero, Birgit Vogtenhuber, Clemens Huemer, Deborah Oliveros

Publication date: 25 August 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.08736

zbMATH Keywords

planar point setsempty convex polygonsErdős-Szekeres type problems

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing optimal islands
• The theory of convex geometries
• Some notes on the Erdős-Szekeres theorem
• Konvexe Fünfecke in ebenen Punktmengen
• Point sets with small integer coordinates and no large convex polygons
• Convexity and the beta invariant
• Finding sets of points without empty convex 6-gons
• An Euler relation for valuations on polytopes
• Counting the interior points of a point configuration
• A superlinear lower bound on the number of 5-holes
• On empty convex polygons in a planar point set
• New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
• Carathéodory's theorem in depth
• Combinatorial sums and finite differences
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Sets with No Empty Convex 7-Gons
• The Erdos-Szekeres problem on points in convex position – a survey
• A Note on the Number of Empty Triangles
• On the Erdős-Szekeres convex polygon problem
• A Generalization of Radon's Theorem
• Crossing Number Problems
• Planar point sets with a small number of empty convex polygons

This page was built for publication: On weighted sums of numbers of convex polygons in point sets