A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane

DOI10.1007/s11856-013-0023-xzbMath1278.52010OpenAlexW2127925693MaRDI QIDQ375507

Rom Pinchasi

Publication date: 31 October 2013

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-013-0023-x

Mathematics Subject Classification ID

Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (6)

A note on the minimum number of red lines needed to pierce the intersections of blue lines ⋮ Crossing by lines all edges of a line arrangement ⋮ A one-page solution of a problem of Erdős and Purdy ⋮ On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points ⋮ Unnamed Item ⋮ Classification theorem for strong triangle blocking arrangements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 2N noncollinear points determine at least 2N directions
• On the number of directions determined by a three-dimensional points set
• Solution of Scott's problem on the number of directions determined by a point set in 3-space
• On the Sets of Directions Determined by n Points
• Sylvester's Problem on Collinear Points and a Relative
• COLLINEARITY PROPERTIES OF SETS OF POINTS

This page was built for publication: A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane