Using counting arguments we extend previous results concerning the coloring of lines in a finite projective plane of order n whose points are n-colored. Suppose the points of the finite projective plane PG(2, n) are colored with n colors. Kabell [2] showed that at least one line must contain points
✦ LIBER ✦
Legitimate colorings of projective planes
✍ Scribed by N. Alon; Z. Füredi
- Publisher
- Springer Japan
- Year
- 1989
- Tongue
- English
- Weight
- 748 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On colorings of finite projective planes
✍
Charles H. Jepsen
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 125 KB
Coloring the projective plane
✍
Joel Spencer
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 835 KB
It is shown that the points of a projective plane may be two-&ore discrepancy at most Knf, K an absolute constant. A variant of the p hat evee line has method is used. Connections to the Komlos Conjecture are discussed.
A note on colorings of finite planes
✍
Jerald A. Kabell
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 88 KB
By counting arguments we show that certain partitions of the points of finitle projective and aftine planes are not possible.
In praise of the legitimation project
✍
Edward Slowik
📂
Article
📅
1999
🏛
Springer
🌐
English
⚖ 670 KB
Simple quasidoubles of projective planes
✍
Dieter Jungnickel; Klaus Vedder
📂
Article
📅
1987
🏛
Springer
🌐
English
⚖ 277 KB
Homomorphisms of projective planes. II
✍
V. V. Vdovin
📂
Article
📅
1987
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 479 KB