Homework assignment Number 14 due Friday, December 3
1. Let G be an undirected graph and let k be an integer. Give a convincing argument that
there is no polynomial time algorithm to determine if there is a clique of size k in the
graph G unless P=NP. If you use a reduction give details of the reduction and an
argument that your reduction works.
Don’t forget to provide the College with your course evaluation. Thanks.
I hope you enjoyed taking the course as much as I enjoyed teaching it.