One of our results: Let ℙ denote a finite projective plane of order n. Colour its vertices by χ colours. If no colour appears more than twice on any of the lines, then χ ≥ n + 1. Explicit constructions show that this bound is sharp when ℙ is desarguesian.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics