Let $G$ be a simple graph. What is the least number of complete sub-graphs $K_{k}$ with the mentioned conditions below?

If there are k sets of vertices in a graph, with the condition that each vertex in a set should be connected to at least one vertex from each of the other sets, then what is the least number of...

22 May 2017 4,897 18 View