MathLabs

Problem 6

A set of lines in the plane is in general position if no two are parallel and no three pass through the same point. A set of lines in general position cuts the plane into regions, some of which have finite area; call these its finite regions. Prove that for all sufficiently large nn, in any set of nn lines in general position it is possible to colour at least n\sqrt{n} of the lines blue in such a way that none of its finite regions has a completely blue boundary.
Step 6 of 6: Conclusion
n large  ⟹  k≥n blue lines, no finite region entirely bluen \text{ large} \implies k \ge \sqrt{n} \text{ blue lines, no finite region entirely blue}
Detailed analysis

The construction always terminates (the number of uncoloured lines strictly decreases), always keeps every finite region non-monochromatic by the correctness step, and always ends with at least ⌈n⌉≥n\lceil\sqrt n\rceil\ge\sqrt n blue lines by the counting bound. This holds for every n≥2n\ge2, and in particular for all sufficiently large nn, proving the statement.