Agoston et al.'s convex hull thrackle conjecture
Agoston et al.'s convex hull thrackle conjecture
Let be a set of points in general position in the plane, and let be a family of distinct convex hulls of subsets of satisfying: no member contains another; every two members intersect; and the intersection of any three distinct members is contained in . Such a family is a convex hull thrackle on .
Agoston et al.'s conjecture. A convex hull thrackle on points has at most convex hulls.
The conjecture is false: the paper constructs, for every , a convex hull thrackle on points with convex hulls. It is nevertheless proved when the points are in convex position, and the paper establishes the general upper bound .
Sources & referencesView supporting material
Primary source
Balázs Keszegh and Dániel Simon, “Convex Hull Thrackles”, arXiv:2307.03252 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.