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

DOI10.1016/j.endm.2007.01.002zbMath1291.05016arXivmath/0602195OpenAlexW2596371529MaRDI QIDQ3439558

Anna de Mier

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0602195

zbMATH Keywords

pattern avoidancenestingordered graphcrossingFerrers diagram

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Related Items

Type-B generalized triangulations and determinantal ideals ⋮ k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams

Cites Work

• Increasing and decreasing sequences in fillings of moon polyominoes
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• A spherical initial ideal for Pfaffians
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• A new class of Wilf-equivalent permutations
• Generalized triangulations and diagonal-free subsets of stack polyominoes
• Wilf-equivalence for singleton classes
• Crossings and nestings of matchings and partitions
• k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams