Let G be a graph with n ≥ 3 vertices that has a clique of size n − 2 but no cliques of size n − 1. Prove that G has two distinct independent sets of size 2. Show your work and complete proof.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 80EQ
icon
Related questions
Question

Let G be a graph with n ≥ 3 vertices that has a clique of size n − 2 but no cliques of size n − 1.
Prove that G has two distinct independent sets of size 2.

Show your work and complete proof.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning