School of Technology and Computer Science Seminars
Turan's Graph Theorem
by Mr. Ajesh Babu (STCS)
Friday, November 27, 2009
from
to
(Asia/Kolkata)
at Colaba Campus ( AG-66 )
at Colaba Campus ( AG-66 )
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? |
Organised by | John Barretto |
PODCAST | click here to start |