Graphs and Matroids Seminar - Lise Turner

Title: 

Abstract:

There are several different notions of what it means for a graph to converge. One popular notion for sparse graphs is Benjamini-Schramm convergence which focuses on local properties of the graphs. The dichromatic and rank polynomials are bivariate graph polynomials that can be restricted to yield any graph identity satisfying deletion-contraction identities. In this talk, I will show that Benjamini-Schramm convergence implies convergence of the distribution of coefficients for both these polynomials under suitable assumptions.

Joint work with Sergey Norin, Calum MacRury and Dmitry Jakobson.