Péter Csíkvári: Extremal regular graphs

Speaker: Péter Csíkvári

Title: Extremal regular graphs

Abstract: In this talk I will survey a few extremal graph theoretic results concerning regular graphs. It turns out that for many graph parameters the extremal regular graph is one of the following three graphs: the complete graph K_{d+1}, the complete bipartite graph K_{d,d}, and somewhat surprisingly, the infinite d-regular tree. I will give a few cute proofs, but nothing deep.