Question: Suppose that a graph with n 3 vertices has a clique of size n - 2, but does not have a clique of size
Suppose that a graph with n 3 vertices has a clique of size n - 2, but does not have a clique of size n - 1. Prove that this graph has two distinct independent sets of size 2.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
