Agoston et al.'s convex hull thrackle conjecture

At least 2 years old · documented by

Let PP be a set of nn points in general position in the plane, and let C(S)C(\mathcal{S}) be a family of distinct convex hulls of subsets of PP satisfying: no member contains another; every two members intersect; and the intersection of any three distinct members is contained in PP. Such a family is a convex hull thrackle on PP.

Agoston et al.'s conjecture. A convex hull thrackle on nn points has at most nn convex hulls.

The conjecture is false: the paper constructs, for every n≥6n\geq 6, a convex hull thrackle on nn points with n+1n+1 convex hulls. It is nevertheless proved when the points are in convex position, and the paper establishes the general upper bound 2n2n.

References

Primary source

Balázs Keszegh and Dániel Simon, “Convex Hull Thrackles”, arXiv:2307.03252 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.