An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines

DOI10.2307/4145133MaRDI QIDQ4653090zbMATH OpenOpenAlexFDO

Authors Konrad J. Swanepoel, L. M. Pretorius

Publication date 28 February 2005

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/4145133

zbMATH Keywords

Euclidean planeprojective plane

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Elementary problems in Euclidean geometries (51M04)

Recommendations

• A quantitative variant of the multi-colored Motzkin-Rabin theorem
• On the number of monochromatic lines in \(\mathbb{R}^d\)
• scientific article; zbMATH DE number 1341210
• Bichromatic and equichromatic lines in C^2 and R^2
• Bichromatic lines in the plane

Cited in

(6)

• Bichromatic lines with few points
• On a conjecture about monochromatic flats
• On the number of monochromatic lines in \(\mathbb{R}^d\)
• A quantitative variant of the multi-colored Motzkin-Rabin theorem
• Enumerating Motzkin–Rabin geometries
• The Sylvester-Gallai theorem, colourings and algebra

This page was built for publication: An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines

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