# Noon lecture

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)

On 9.3.2006 at 12:20 in S5, there is the following noon lecture:

# k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams

## Anna de Mier

## Abstract

Given a graph on [n], two edges (i,j) and (k,l) are a crossing if i>k>j>l and they are a nesting if i<k<l<j. A k-crossing (k-nesting) is a set of k edges every two of them being a crossing (nesting). Our aim is to show that the number of graphs containing no k-crossing is the same as the number of graphs containing no k-nesting. To do so, we give a correspondence between graphs with a given degree sequence and fillings of Ferrers diagrams by nonnegative integers with prescribed row and column sums. In this setting, k-crossings and k-nestings of the graph become occurrences of the identity and the antiidentity matrices in the filling. We use this to show the equality of the numbers of k-noncrossing and k-nonnesting graphs with a given degree sequence. This generalizes the analogous result for matchings and partition graphs of Chen, Deng, Du, Stanley, and Yan, and extends results of

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | 2018 | 2019 | 2020 | newer lectures)

Webmaster: kamweb.mff.cuni.cz Archive page