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:
“It is so rare to meet with a man outdoors who cherishes a worthy thought in his mind, which is independent of the labor of his hands. Behind every man’s busy-ness there should be a level of undisturbed serenity and industry, as within the reef encircling a coral isle there is always an expanse of still water, where the depositions are going on which will finally raise it above the surface.”
—Henry David Thoreau (1817–1862)
“The believing mind reaches its perihelion in the so-called Liberals. They believe in each and every quack who sets up his booth in the fairgrounds, including the Communists. The Communists have some talents too, but they always fall short of believing in the Liberals.”
—H.L. (Henry Lewis)