Abstract
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 Klazar to k > 2. Moreover, this correspondence reinforces the links recently discovered by Krattenthaler between fillings of diagrams and the results of Chen et al.
Similar content being viewed by others
References
J. Backelin, J. West and G. Xin: Wilf-equivalence for singleton classes, Adv. Appl. Math. 38 (2007), 133–148.
M. Bálek, D. Hartman and J. Kára, eds.: Open problems for Homonolo 2005, KAM-DIMATIA Series 2005-749 (2005), 11–12.
M. Bousquet-Mélou and E. Steingrímsson: Decreasing subsequences in permutations and Wilf equivalence for involutions, J. Algebraic Combin. 22 (2005), 383–409.
W. Y. C. Chen, E. Y. P. Deng, R. R. X. Du, R. P. Stanley and C. H. Yan: Crossings and nestings of matchings and partitions, Trans. Amer. Math. Soc. 359 (2007), 1555–1575.
V. Jelínek: Dyck paths and pattern-avoiding matchings, European J. Combin. 28 (2007), 202–213.
V. Jelínek and M. Klazar: private communication (2005).
J. Jonsson: Generalized triangulations and diagonal-free subsets of stack polyominoes, J. Combin. Theory Ser. A 112 (2005), 117–142.
J. Jonsson and V. Welker: A spherical initial ideal for Pfaffians, arXiv:math.CO/0601335.
A. Kasraoui and J. Zeng: Distribution of crossings, nestings and alignments of two edges in matchings and partitions, Electron. J. Combin. 13 (2006), Research paper #33.
M. Klazar: Counting pattern-free set partitions II: noncrossing and other hypergraphs; Electron. J. Combin. 7 (2000), Research paper #34.
M. Klazar: On identities concerning the numbers of crossings and nestings of two edges in matchings, SIAM J. Discrete Math. 20 (2006), 960–976.
C. Krattenthaler: Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes; Adv. Appl. Math. 37 (2006), 404–431.
A. de Mier: On the symmetry of the distribution of crossings and nestings in graphs, Electron. J. Combin. 13 (2006), Note #21.
M. Noy: private communication (2006).
M. Rubey: Increasing and decreasing sequences in fillings of moon polyominoes, arXiv:math.CO/0604140.
Z. Stankova and J. West: A new class of Wilf-equivalent permutations, J. Alg. Combin. 15 (2002), 271–290.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
de Mier, A. k-noncrossing and k-nonnesting graphs and fillings of ferrers diagrams. Combinatorica 27, 699–720 (2007). https://doi.org/10.1007/s00493-007-2297-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-007-2297-2