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

University of Cambridge > Talks.cam > Combinatorics Seminar > Expanders, Ramanujan graphs and random lifts

## Expanders, Ramanujan graphs and random liftsAdd to your list(s) Download to your calendar using vCal - Benny Sudakov (UCLA)
- Wednesday 10 March 2010, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason. Expansion of a graph is one of the most fundamental concepts in modern combinatorics, which has numerous applications in many mathematical areas. It is well known that expansion is closely relates to the spectral properties of graph. The celebrated Alon-Boppana bound says that all eigenvalues of a d-regular graph must be at least 2sqrt(d-1) – o(1) and graphs that meet this bound are called Ramanujan Graphs. There are still many unresolved questions about the existence of such graphs. In this talk we survey this background material, then we explain what lifts of graphs are and how the above questions can be approached using random lifts of graphs. Joint work with Lubetzky and Vu. 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
- bld31
Note that ex-directory lists are not shown. |
## Other listsCambridge University Amnesty International Dirac Lecture Cambridge Review of International Affairs## Other talksSine-Gordon on a Wormhole My VM is Lighter (and Safer) than your Container The Warsaw Uprising in Polish Popular Culture after 1989 How T-cells cause autoimmune disease and hold the key to curing cancer Electoral intrigue, ethnic politics and the vibrancy of the Kenyan public sphere Understanding and Estimating Physical Parameters in Electric Motors using Mathematical Modelling |