- Source: Heawood number
In mathematics, the Heawood number of a surface is an upper bound for the number of colors that suffice to color any graph embedded in the surface.
In 1890 Heawood proved for all surfaces except the sphere that no more than
H
(
S
)
=
⌊
7
+
49
−
24
e
(
S
)
2
⌋
=
⌊
7
+
1
+
48
g
(
S
)
2
⌋
{\displaystyle H(S)=\left\lfloor {\frac {7+{\sqrt {49-24e(S)}}}{2}}\right\rfloor =\left\lfloor {\frac {7+{\sqrt {1+48g(S)}}}{2}}\right\rfloor }
colors are needed to color any graph embedded in a surface of Euler characteristic
e
(
S
)
{\displaystyle e(S)}
, or genus
g
(
S
)
{\displaystyle g(S)}
for an orientable surface.
The number
H
(
S
)
{\displaystyle H(S)}
became known as Heawood number in 1976.
Franklin proved that the chromatic number of a graph embedded in the Klein bottle can be as large as
6
{\displaystyle 6}
, but never exceeds
6
{\displaystyle 6}
. Later it was proved in the works of Gerhard Ringel, J. W. T. Youngs, and other contributors that the complete graph with
H
(
S
)
{\displaystyle H(S)}
vertices can be embedded in the surface
S
{\displaystyle S}
unless
S
{\displaystyle S}
is the Klein bottle. This established that Heawood's bound could not be improved.
For example, the complete graph on
7
{\displaystyle 7}
vertices can be embedded in the torus as follows:
The case of the sphere is the four-color conjecture, which was settled by Kenneth Appel and Wolfgang Haken in 1976.
Notes
Béla Bollobás, Graph Theory: An Introductory Course, Graduate Texts in Mathematics, volume 63, Springer-Verlag, 1979. Zbl 0411.05032.
Thomas L. Saaty and Paul Chester Kainen; The Four-Color Problem: Assaults and Conquest, Dover, 1986. Zbl 0463.05041.
This article incorporates material from Heawood number on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.
References
Kata Kunci Pencarian:
- Adele
- Heawood number
- Heawood conjecture
- Heawood graph
- Heawood
- Percy John Heawood
- Torus
- Four color theorem
- Crossing number (graph theory)
- Jonathan Heawood
- Graph coloring
