It is proved that every finite graph with n≧7 vertices and at least $\frac {9} {2}\mathrm {n}-12$ edges which is not a 4-cockade composed of complete 6-graphs and/or complete 8-graphs with four ...

Graph homomorphisms and chromatic numbers are foundational concepts in modern graph theory, with widespread applications that extend from combinatorial optimisation to theoretical computer science.