Abstract
For a projective plane ℙn of order n, let κ{script}(ℙn) denote the minimum number k, so that there is a coloring of the points of ℙn in k colors such that no two distinct lines contain precisely the same number of points of each color. Answering a question of A. Rosa, we show that for all sufficiently large n, 5 ≤κ{script}(ℙn) ≤ 8 for every projective plane ℙn of order n.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 95-106 |
| Number of pages | 12 |
| Journal | Graphs and Combinatorics |
| Volume | 5 |
| Issue number | 1 |
| DOIs | |
| State | Published - Dec 1989 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'Legitimate colorings of projective planes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver