skip to content

Lipschitz functions on graphs

Presented by: 
C McDiarmid [Oxford]
Wednesday 25th June 2008 - 16:20 to 17:00
Center for Mathematical Sciences
Let G be a connected graph. A real vector x indexed by the vertices is called Lipschitz if the values on the ends of each edge differ by at most 1. Given a suitable function f(x) we are interested in the maximum value of f(x-\bar{x}) over all Lipschitz x. This maximum value f^*(G) is related to certain isoperimetric inequalities.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons