The quarter-size upper-bound conjecture for crossing families of elbows

From papers

Let SS be a set of nn points in the plane in general position. An elbow is an orthogonal geometric-graph edge consisting of one horizontal and one vertical line segment, and a crossing family of elbows is a family in which every two elbows cross. Elbow crossing-family conjecture. There are point sets of nn elements that do not admit a crossing family of elbows with more than n/4\lfloor n/4\rfloor elements. The proved lower bound is n/4\lfloor n/4\rfloor, while the matching upper-bound construction remains conjectural.

Progress summary

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

Sources & referencesView supporting material

Primary source

José Luis Álvarez-Rebollar, Jorge Cravioto-Lagos, Nestaly Marín, Oriol Solé-Pi and Jorge Urrutia, “Crossing and intersecting families of geometric graphs on point sets”, arXiv:2211.09904 (2022).

Solutions 0

No solutions have been posted yet.