Combinatorics Seminar

Fall 2012 / Spring 2013 -- Wednesdays at 1 pm

Lippitt Hall    Room 204


         Fall 2012
  November 14        G. Lippner     Invariant perfect matchings in Cayley graphs
  Abstract: We discuss the existence of random perfect matchings in Cayley graphs whose distribution is translation invariant. In particular we show that for non-amenable groups such a matching can be constructed as a "factor of IID". This can also be generalized in the context of measurable graphs. The key step of the construction is to show that a partial matching in a large finite expander has short augmenting paths.

Past semesters:      Fall2011/Spring2012      Spring 2011      Fall 2010      Spring 2010      Fall 2009      Spring 2009      Fall 2008      Fall 2007      Spring 2007

Journals in Discrete Mathematics and related fields