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:
“Nevertheless, in the Lord woman is not independent of man or man independent of woman. For just as woman came from man, so man comes through woman; but all things come from God.”
—Bible: New Testament, 1 Corinthians 11:11.
In v. 9, Paul wrote “Neither was man created for woman, but woman for man.”
“Wilson adventured for the whole of the human race. Not as a servant, but as a champion. So pure was this motive, so unflecked with anything that his worst enemies could find, except the mildest and most excusable, a personal vanity, practically the minimum to be human, that in a sense his adventure is that of humanity itself. In Wilson, the whole of mankind breaks camp, sets out from home and wrestles with the universe and its gods.”
—William Bolitho (1890–1930)