Crossing by lines all edges of a line arrangement

DOI10.1016/j.disc.2013.07.008zbMath1279.05012OpenAlexW2094964930MaRDI QIDQ389464

Rom Pinchasi

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.07.008

zbMATH Keywords

line arrangementDirac's conjecturezone theorem

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Other designs, configurations (05B30) Configuration theorems in linear incidence geometry (51A20)

Related Items (2)

A note on the minimum number of red lines needed to pierce the intersections of blue lines ⋮ Crossing edges and faces of line arrangements in the plane

Cites Work

• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• Progress on Dirac's conjecture
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Extremal problems in discrete geometry
• Improving the crossing lemma by finding more crossings in sparse graphs
• The power of geometric duality
• Some combinatorial problems in the plane
• Arrangements of Lines with a Large Number of Triangles
• COLLINEARITY PROPERTIES OF SETS OF POINTS
• Unnamed Item

This page was built for publication: Crossing by lines all edges of a line arrangement