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

Expanders, Ramanujan graphs and random lifts

Add to your list(s) Download to your calendar using vCal

  • UserBenny Sudakov (UCLA)
  • ClockWednesday 10 March 2010, 14:30-15:30
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity