Seminar in Combinatorial Computation




Topics recently covered: Graph
coloring in expected polynomial time, Graph colouring via the probabilistic
method, ksets in 2 and 3 dimensions, Unit distances among vertices of
a convex polygon, Testing first order graph properties, Computing the
volume of convex bodies, The existential theory of reals and some elementary
geometric problems, Constructing public key cryptosystems via combinatorial
group theory, The Hanna Neumann conjecture, The Ramsey arrow and the polynomial
hierarchy, Graceful graphs, Optimal packing of induced stars in a graph,
Random processes, Graph embedding problems, Delsarte's linear program.
