62
Chat with our AI personalities
Well of n vertices you can get the comlete graphs of kn-1 I just did a similar problem where you find the k3 graphs in kn I found the answer to be n choose 3 becaause i simply neeeded to choose 3 different vertices so the number of k4 grpahs would be n choose 4 and so on the number of edges or complete k2 graphs is n choose 2 I know i didnt answer your question but i feel as if this might help u get it done
Infinitely many. Infinitely many. Infinitely many. Infinitely many.
Infinitely many. Infinitely many. Infinitely many. Infinitely many.
so many hours
many