✦ LIBER ✦

Coloring the projective plane

✍ Scribed by Joel Spencer

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 835 KB
Volume: 73
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90150-1

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On colorings of finite projective planes

✍ Charles H. Jepsen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 125 KB

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

The Signed Chromatic Number of the Proje

The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring

✍ T. Zaslavsky 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Another six-coloring of the plane

✍ Ilya Hoffman; Alexander Soifer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 92 KB

A six-coloring of the Euclidean plane is constructed such that the distance 1 is not realized by any color except one, which does not realize the distance x/2 -1. A 44-year-old problem due to Edward Nelson asks to find the chromatic number x(E 2) of the plane, i.e. the minimal number of colors that

A six-coloring of the plane

✍ Alexander Soifer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 103 KB

Minimal embeddings in the projective pla

Minimal embeddings in the projective plane

✍ Randby, Scott P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

We show that if G is a graph embedded on the projective plane in such a way that each noncontractible cycle intersects G at least n times and the embedding is minimal with respect to this property (i.e., the representativity of the embedding is n), then G can be reduced by a series of reduction oper

Planar graphs on the projective plane

✍ Bojan Mohar; Neil Robertson; Richard P. Vitray 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 958 KB