Graduate Combinatorics Seminar
Sam Cole
Finding large cliques in random graphs
Abstract: Last time we saw that in a random graph we know almost exactly the size of the largest clique. But how do we actually find it? It is not know how to do so efficiently, but we will see a simple algorithm for finding a clique at least half the size of the largest.
Wednesday February 18, 2015 at 4:00 PM in SEO 712