加载中…
Motzkin, Grünbaum, and Erdős and Purdy asked how many noncollinear blue points can coexist with red points in the real plane if every blue-spanned line contains a red point. We prove that there are at most blue points, even over the complex numbers. For the complex higher-dimensional problem of Campbell, Kroeker, and Lund, we prove . Colorings of cyclic Dowling geometries give a matching lower bound in order of magnitude for all and . The planar proof uses frame normalization and a second-moment estimate; the higher-dimensional proof combines the degree bound of Kroeker and Lund with principal truncation.

生成讲解博客的中文版本

生成AI智能校验的中文版本