Turan's theorem provides minimum number of edges of a graph on $n$ vertices to surely contain a clique of a prescribed size. This has been generalized to regular graphs.

What additional specializations have been made in the literature if the graph is regular and contains additional algebraic structure?