Search arXivSearch

arXiv · 2509.00138

Improvement on line transversals of families of connected sets in the plane

Abstract

Three lines are concurrent if they intersect at a single point. In this paper I prove that if $F$ is a bounded family of compact connected sets in the plane, such that every three sets in $F$ can be pierced by a single line, then there exists three concurrent lines in the plane such that the union of the three lines intersect every member of $F$. This had previously only been proven for lines that are not required to be concurrent by McGinnis and Zerbib in arXiv:2103.05565v2. In fact, I prove a more general, ``colorful'' version of this result: If $F_1, \dots , F_5$ are bounded families of compact connected sets in the plane such that every three sets, chosen from three distinct families $F_i$, can be pierced by a single line, then there exists $1 \leq j \leq 5$ and three concurrent lines, such that the union of the three lines intersect every member of $F_j$. McGinnis and Zerbib had 6 families instead of 5, so I also improve their result in this respect. Moreover, the result can also be extended to unbounded families, if we allow the piercing lines to be parallel.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Miklós Csizmadia. 2025-08-29. Improvement on line transversals of families of connected sets in the plane. https://arxiv.org/abs/2509.00138

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO