The links to the talks listed below are links to pdf files. Download the latest version of Adobe Acrobat Reader from here to view these files. I have yet to put all the talks here.
| » Extremal problems for cycles in graphs |
| » Invited lecture. Oberwolfach Combinatorics Workshop January 6th to 12th 2008. |
| » Organizers Laszlo Lovasz and Jeff Kahn |
| » Institute for pure and applied mathematics September - December 2009. |
| » Organizers Noga Alon, Gil Kalai, Janos Pach, Vera Sos, Angelika Steger, Benny Sudakov, Terence Tao. |
| » Correction: in my talk I said constructing Cayley graphs X(G,S) which are hexagon-free almost extremal graphs implies the exponent of matrix multiplication is two. In fact, one requires control of the characters of G, not just a set of generators of size around |G|^(1/3). I will put some precise details here soon. |
| » Conjectures from talks |