Re: How many cliques of size k in a r-regular graph?



On May 1, 10:25 pm, chhealey <chhea...@xxxxxxxxx> wrote:
Anyone can help to solve how many cliques of size k in a undirected
regular graph G, where G has n vertices and each vertex in G has
degree r. Thank you.

What do you mean by "how many"? You want the minimum, the maximum,
some kind of average, or something else? What is your answer when k =
3, n = 6, r = 2?

.