Turan's Graph Theorem

Speaker:

Ajesh Babu School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road

Date:

Friday, 27 Nov 2009 (all day)

Venue:

A-212 (STCS Seminar Room)

Category:

Student Seminar

Abstract

Consider the set of all n-vertex graphs that does not contain a k-clique. What is the maximum number of edges that any graph in this set have?