Convex hull thrackles

Keszegh, Balázs and Simon, Daniel (2026) Convex hull thrackles. DISCRETE MATHEMATICS, 349 (3). ISSN 0012-365X

Preview

Text 2307.03252v1.pdf - Draft Version Download (726kB) | Preview

Abstract

A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of vertices. It is known that this conjecture holds for linear thrackles, i.e., when the edges are drawn as straight line segments. We consider \emph{convex hull thrackles}, a recent generalization of linear thrackles from segments to convex hulls of subsets of points. We prove that if the points are in convex position then the number of convex hulls is at most the number of vertices, but in general there is a construction with one more convex hull. On the other hand, we prove that the number of convex hulls is always at most twice the number of vertices.

Actions (login required)

Edit Item