School of Technology and Computer Science Seminars

Turan's Graph Theorem

Name: Turan's Graph Theorem
Start: 2009-11-27T16:00:00+05:30
End: 2009-11-27T17:00:00+05:30
Location: Colaba Campus

by Mr Ajesh Babu (STCS)

Friday 27 Nov 2009, 16:00 → 17:00 Asia/Kolkata

AG-66 (Colaba Campus)

Description

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?