Turan's Graph Theorem

Speaker:

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

Friday, 27 November 2009 (All day)

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?

Prahladh Harsha appointed as Editor in Chief of ACM TOCT

Prof. Prahladh Harsha has been appointed as the Editor-in-Chief of ACM's Transactions on Computation Theory journal.

Siddharth Bhandari wins ACM India 2022 Doctoral Dissertation Award

Siddharth Sandipkumar Bhandari is the recipient of the ACM India 2022 Doctoral Dissertation Award for his dissertation titled “Exact Sampling and L

Kumar Saurav's Infocom 2021 paper presentation

Kumar Saurav, a graduate student at the School of Technology and Computer Science has been invited by ACM-India's Academic Research and Careers for