School Seminars and Colloquia

Spectral Graph Theory (XXII): Eigenvalues and quasi-randomness (Part IV)

Discrete Structures and Algorithms (Reading Group)

by Arun Mani

Institution: The University of Melbourne
Date: Wed 3rd October 2012
Time: 10:00 AM
Location: Room 107, Richard Berry Building

Abstract: I will close our discussions on quasi-randomness with results that bring together the two seemingly very different invariants of a graph that I discussed thus far, namely its edge
discrepancy and its deviation. In particular, I will talk about why an
almost regular graph with low discrepancy is also an almost regular
graph with low deviation, and vice versa.