A note on the minimum number of red lines needed to pierce the intersections of blue lines

DOI10.1016/J.COMGEO.2022.101863MaRDI QIDQ2123295zbMATH OpenOpenAlexWikidataFDO

Authors Mario Huicochea, J. Leaños, Luis Manuel Rivera

Publication date 8 April 2022

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2022.101863

zbMATH Keywords

combinatoricsfamily of linesline arrangementred lines required to pierce blue intersectionsweak Dirac's conjecture

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Finite affine and projective planes (geometric aspects) (51E15) Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Review text

\textit{P. Erdős} and \textit{G. Purdy} [J. Comb. Theory, Ser. A 25, 205--210 (1978; Zbl 0422.05023)] suggested the following problem: Problem: Let \(\mathcal{L}\) be a set of \(n\) non-concurrent blue lines and let \(\mathcal{R}\) be a set of \(m\) red lines in the real projective plane. If \(\mathcal{L} \cap \mathcal{R} = \emptyset\) and there is a line from \(\mathcal{R}\) through every intersection point of lines in \(\mathcal{L}\), how big is \(m\) in terms of \(n\)? Before the current work, the best known bound for this problem was \(m \geq \frac{1}{3}(n- 1)\) obtained by \textit{R. Pinchasi} [Isr. J. Math. 198, 205--214 (2013; Zbl 1278.52010)]. Using mainly elementary geometric arguments, the authors improve the former result of R. Pinchasi by proving that: \[m \geq \frac{4}{11}\left( n - \frac{13}{11}\right).\]

Recommendations

• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• Crossing by lines all edges of a line arrangement
• Crossing edges and faces of line arrangements in the plane
• Tight bounds on a problem of lines and intersections
• Extremal problems in discrete geometry

Cites work

• A one-page solution of a problem of Erdős and Purdy
• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• Classification theorem for strong triangle blocking arrangements
• Crossing by lines all edges of a line arrangement
• Extremal problems in discrete geometry
• On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Progress on Dirac's conjecture
• Some combinatorial problems in the plane

Cited in

(2)

• Crossing by lines all edges of a line arrangement
• Crossing edges and faces of line arrangements in the plane

This page was built for publication: A note on the minimum number of red lines needed to pierce the intersections of blue lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123295)