MATH Seminar

Title: A new proof of the known cases of Sidorenko's conjecture
Seminar: Combinatorics
Speaker: Leonardo Nagami Coregliano of The University of Toronto and the University of Sao Paulo
Contact: Dwight Duffus, dwight@mathcs.emory.edu
Date: 2013-04-26 at 4:00PM
Venue: MSC W303
Download Flyer
Abstract: One of the simplests statements of Sidorenko's conjecture is an inequality bounding the homomorphism density from a bipartite graph to a non-empty graph. Due to extensive research the conjecture has been established for various classes of bipartite graphs. The proofs, however, are often complicated and seem to have little relation to one another. Recently (in a yet unpublished paper), Balázs Szegedy gave a new, unified proof of all known cases for which Sidorenko's conjecture has been established. Our aim in this talk is to give some idea of how this proof goes and to discuss which cases it covers.