and graphs that avoid larger cliques as subgraphs in Turán's theorem, and these two complete bipartite graphs are examples of Turán graphs, the extremal graphs for this more general problem.
*The complete bipartite graph has a vertex covering number of and an edge covering number of
*The complete