Get access

An Extremal Property of Turán Graphs, II


  • Dedicated to the memory of Professor Herbert S. Wilf.


Let inline image denote Turán's graph—the complete 2-partite graph on n vertices with partition sizes as equal as possible. We show that for all inline image, the graph inline image has more proper vertex colorings in at most 4 colors than any other graph with the same number of vertices and edges.

Get access to the full text of this article