In a previous post, it was said that evey graph has a clique of size one.
How come? as I understand it, for a graph to have a 1-clique it must has a loop. Am I right?
ant about k=0, every graph has a 0-clique right?
And another thing about Q6:
May we assume the graphs are simple? or maybe even that k>1?