Turan's theorem for balanced r-partite graphs

121 Views Asked by At

I'm curious about the following restricted version of Turan's theorem:

Among all $r$-partite graphs that are balanced (exactly $n/r$ nodes per part), what is the maximum size of a graph with no $r$-cliques?