• Source: Golomb graph

In graph theory, the Golomb graph is a polyhedral graph with 10 vertices and 18 edges. It is named after Solomon W. Golomb, who constructed it (with a non-planar embedding) as a unit distance graph that requires four colors in any graph coloring. Thus, like the simpler Moser spindle, it provides a lower bound for the Hadwiger–Nelson problem: coloring the points of the Euclidean plane so that each unit line segment has differently-colored endpoints requires at least four colors.




Construction



The method of construction of the Golomb graph as a unit distance graph, by drawing an outer regular polygon connected to an inner twisted polygon or star polygon, has also been used for unit distance representations of the Petersen graph and of generalized Petersen graphs. As with the Moser spindle, the coordinates of the unit-distance embedding of the Golomb graph can be represented in the quadratic field




Q

[


33


]


{\displaystyle \mathbb {Q} [{\sqrt {33}}]}

.




Fractional coloring


The fractional chromatic number of the Golomb graph is 10/3. The fact that this number is at least this large follows from the fact that the graph has 10 vertices, at most three of which can be in any independent set. The fact that the number is at most this large follows from the fact that one can find 10 three-vertex independent sets, such that each vertex is in exactly three of these sets.
This fractional chromatic number is less than the number 7/2 for the Moser spindle and less than the fractional chromatic number of the unit distance graph of the plane, which is bounded between 3.6190 and 4.3599.




References






External links


Weisstein, Eric W. "Golomb Graph". MathWorld.

Kata Kunci Pencarian:

• Garis besar kombinatorik
• Golomb graph
• Solomon W. Golomb
• Golomb coding
• Graph labeling
• List of graphs
• Hadwiger–Nelson problem
• Unit distance graph
• List of graphs by edges and vertices
• Moser spindle
• List of algorithms