In the second part we look at commonness. Jagger, Stovicek and Thomason  defined the class of k-common graphs, and showed among other results that every graph containing K4 as a subgraph is not 2-common. We prove that every graph containing K3 as a subgraph is not 3-common.If g is the 3-coloring of Kni then the complements of g are g7[1 and 3^2. Let u, x, v, and y be the vertices of K4, then the 3-coloring, g, of Kn will be represented by [g( uv), g(vx), g(xy), g(uy), g(ux), g(vy)}. The 24 sets of 3-colorings of K4 representedanbsp;...
|Title||:||Triangle Problems in Extremal Graph Theory|
|Publisher||:||ProQuest - 2008|