Bichromatic lines with few points
According to a celebrated result of \textit{J. Sylvester} [Educational Times 59, 98-99 (1893)] and \textit{T. Gallai} [Am. Math. Monthly 51, 169-171 (1944)], any set \(P\) of non-collinear points in the plane determines a so-called ordinary line, i. e., a line passing through precisely two elements of \(P\). Recently, K. Fukuda [see the paper of \textit{P. F. Da Silva} and \textit{K. Fukuda}, J. Geom. 62, 48-65 (1998; Zbl 0938.52012)] conjectured that this result can be generalized as follows. Let \(R\) be a set of red points and let \(B\) be a set of blue points, not all on a line. Assume that (i) \(R\) and \(B\) separated by a straight line, and (ii) \(|R|\) and \(|B|\) differ by at most one. Then there exists a bichromatic ordinary line, i.e., a line passing through precisely one red and one blue point. The authors remark that this statement does not remain true if we drop any of the above assumptions. The aim of the present note is to show that there always exist bichromatic lines containing relatively few points of \(R\cup B\). In particular, it is shown that if \(|R|=|B|=n\) then there exist more than \(n/2\) bichromatic lines passing through at most two red points and at most two blue points.
- Bichromatic lines in the plane
- Bichromatic and equichromatic lines in C^2 and R^2
- An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines
- A survey of Sylvester's problem and its generalizations
- On the number of ordinary circles determined by \(n\) points
- scientific article; zbMATH DE number 861411
- scientific article; zbMATH DE number 2068103
- A sharpening of Fisher's inequality
- A de Bruijn-Erdős theorem and metric spaces
- Bichromatic and equichromatic lines in C^2 and R^2
- Discrete geometry on colored point sets in the plane -- a survey
- A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
- Bichromatic lines in the plane
- On the number of balanced lines
- On \(r\)-equichromatic lines with few points in \(\mathbb{C}^2\)
- Computing the coarseness measure of a bicolored point set over guillotine partitions
This page was built for publication: Bichromatic lines with few points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1570762)
