On Sets of Monochromatic Objects in Bicolored Point Sets

Let $P$ be a set of $n$ points in the plane, not all on a line, each colored \emph{red} or \emph{blue}. The classical Motzkin–Rabin theorem guarantees the existence of a \emph{monochromatic} line. Motivated by the seminal work of Green and Tao (2013) on the Sylvester-Gallai theorem, we investigate the quantitative and structural properties of monochromatic geometric objects, such as lines, circles, and conics. We first show that if no line contains more than three points, then for all sufficiently large $n$ there are at least $n^{2}/24 - O(1)$ monochromatic lines. We then show a converse of a theorem of Jamison (1986): Given $n\ge 6$ blue points and $n$ red points, if the blue points lie on a conic and every line through two blue points contains a red point, then all red points are collinear. We also settle the smallest nontrivial case of a conjecture of Milićević (2018) by showing that if we have $5$ blue points with no three collinear and $5$ red points, if the blue points lie on a conic and every line through two blue points contains a red point, then all $10$ points lie on a cubic curve. Further, we analyze the random setting and show that, for any non-collinear set of $n\ge 10$ points independently colored red or blue, the expected number of monochromatic lines is minimized by the \emph{near-pencil} configuration. Finally, we examine monochromatic circles and conics, and exhibit several natural families in which no such monochromatic objects exist.

💡 Research Summary

The paper investigates monochromatic geometric objects in a planar point set whose points are colored red or blue. Starting from the classical Motzkin–Rabin theorem, which guarantees at least one monochromatic line, the authors develop quantitative and structural results for several families of objects: lines, circles, conics (quadratic curves), and cubic curves.

The first main theorem addresses the case where no line contains more than three points. Using a double‑counting argument together with a graph‑matching perspective, the authors prove that for sufficiently large n the number of monochromatic lines is at least n²/24 − O(1). This improves the trivial linear lower bound to a quadratic one and shows that even under a strong “no‑four‑collinear” restriction the set must generate many same‑color lines.

The second contribution is a converse of a theorem of Jamison (1986). Jamison proved that if a set of blue points lies on a conic and every line through two blue points contains a red point, then the red points must be collinear. The authors reverse the implication: assuming the same hypotheses (blue points on a conic, every blue‑blue line meets a red point) they deduce that the red points are forced to lie on a single line. The proof exploits the tangential and secant structure of a conic and adapts a colored version of the Sylvester–Gallai theorem to obtain a contradiction if the red points were not collinear.

The third result settles the smallest non‑trivial case of a conjecture of Milićević (2018). For five blue points in general position (no three collinear) that lie on a conic, and five red points such that every line through two blue points contains a red point, the authors show that all ten points must lie on a cubic curve. The argument combines Bézout’s theorem with a degree‑restriction analysis: if no cubic curve existed, the incidence conditions would violate the count of intersection points dictated by algebraic geometry, forcing the existence of a cubic that contains the entire configuration.

In the probabilistic setting, the authors consider a fixed non‑collinear set of n ≥ 10 points that are independently colored red or blue with equal probability. They compute the expected number of monochromatic lines and prove that the configuration minimizing this expectation is the “near‑pencil”: all but a constant number of points lie on a single line, with the remaining points placed off that line. By enumerating all possible lines and applying a combinatorial optimization argument, they show that any deviation from the near‑pencil increases the expected count, establishing near‑pencil as the extremal arrangement.

Finally, the paper turns to monochromatic circles and conics. The authors construct several natural families of point sets (e.g., lattice arrangements, regular polygons with alternating colors, symmetric colorings) and demonstrate that in each family no monochromatic circle or conic exists. The proofs rely on complex‑plane algebraic curve theory and angle‑restriction arguments: any circle determined by two same‑color points inevitably passes through a point of the opposite color, and analogous statements hold for conics. These examples illustrate that, unlike lines, higher‑degree monochromatic objects can be completely avoided under suitable geometric and coloring constraints.

Overall, the work provides a comprehensive treatment of monochromatic objects in bicolored point sets, delivering new quantitative lower bounds, converse structural theorems, special‑case confirmations of broader conjectures, extremal results in random colorings, and explicit constructions where certain monochromatic curves are impossible. The blend of combinatorial geometry, algebraic curve theory, and probabilistic methods makes the paper a significant contribution to the study of colored point configurations.