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-XMaRDI QIDQ375507zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bichromatic lines in the plane
• On a Problem of Groübaum
• A one-page solution of a problem of Erdős and Purdy
• Bichromatic lines with few points
• The Solution to a Problem of Grünbaum

Cites work

• scientific article; zbMATH DE number 431988 (Why is no real title available?)
• scientific article; zbMATH DE number 3857867 (Why is no real title available?)
• scientific article; zbMATH DE number 3907263 (Why is no real title available?)
• scientific article; zbMATH DE number 3779340 (Why is no real title available?)
• scientific article; zbMATH DE number 1341210 (Why is no real title available?)
• 2N noncollinear points determine at least 2N directions
• COLLINEARITY PROPERTIES OF SETS OF POINTS
• Extremal problems in discrete geometry
• Improving the crossing lemma by finding more crossings in sparse graphs
• On the Sets of Directions Determined by n Points
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• On the number of directions determined by a three-dimensional points set
• Progress on Dirac's conjecture
• Solution of Scott's problem on the number of directions determined by a point set in 3-space
• Some combinatorial problems in the plane
• Sylvester's Problem on Collinear Points and a Relative
• The power of geometric duality

Cited in

(8)

• A note on the minimum number of red lines needed to pierce the intersections of blue lines
• On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points
• A theorem about vectors in \(\mathbb{R}^2\) and an algebraic proof of a conjecture of Erdős and Purdy
• On \(r\)-equichromatic lines with few points in \(\mathbb{C}^2\)
• Classification theorem for strong triangle blocking arrangements
• Crossing by lines all edges of a line arrangement
• Bichromatic lines in the plane
• A one-page solution of a problem of Erdős and Purdy

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

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