COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Isoperimetry in integer latticesAdd to your list(s) Download to your calendar using vCal - Ben Barber (University of Bristol)
- Thursday 16 November 2017, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. The edge isoperimetric problem for a graph G is to find, for each n, the minimum number of edges leaving any set of n vertices. Exact solutions are known only in very special cases, for example when G is the usual cubic lattice on Z This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
Note that ex-directory lists are not shown. |
## Other listsFeminism Cambridge Defend Education EED Film Series: 'Waiting for Superman'## Other talksFeeling Revolution TBC LIFESKILLS - WANT TO BE PROFESSIONALLY REGISTERED? London Overground Dr. Nathalie Juge - Title to be confirmed Can social networks explain why females cheat? |