Coloring and Independent Sets
According to Brooks' theorem every cubic graph other than the complete graph K4 can be colored with at most three colors. Therefore, every cubic graph other than K4 has an independent set of at least n/3 vertices, where n is the number of vertices in the graph: for instance, the largest color class in a 3-coloring has at least this many vertices.
According to Vizing's theorem every cubic graph needs either three or four colors for an edge coloring. A 3-edge-coloring is known as a Tait coloring, and forms a partition of the edges of the graph into three perfect matchings. By König's line coloring theorem every bicubic graph has a Tait coloring.
The bridgeless cubic graphs that do not have a Tait coloring are known as snarks. They include the Petersen graph, Tietze's graph, the Blanuša snarks, the flower snark, the double-star snark, the Szekeres snark and the Watkins snark. There is an infinite number of distinct snarks.
Read more about this topic: Cubic Graph
Famous quotes containing the words independent and/or sets:
“I have defeated them all.... I was left with some money to battle with the world when quite young, and at the present time have much to feel proud of.... The Lord gave me talent, and I know I have done good with it.... For my brains have made me quite independent and without the help of any man.”
—Harriet A. Brown, U.S. inventor and educator. As quoted in Feminine Ingenuity, ch. 8, by Anne L. MacDonald (1992)
“It is time to be old,
To take in sail:—
The god of bounds,
Who sets to seas a shore,
Came to me in his fatal rounds,
And said: ‘No more!’”
—Ralph Waldo Emerson (1803–1882)