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

DOI10.1007/S00493-007-2297-2zbMATH Open1164.05002OpenAlexW2048313572MaRDI QIDQ950332FDOQ950332

Authors Anna de Mier

Publication date 22 October 2008

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-007-2297-2

zbMATH Keywords

Ferrers diagramscrossing graphsforbidden matricesnesting graphs

Mathematics Subject Classification ID

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

Recommendations

• k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
• On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
• Crossings and nestings of two edges in set partitions
• Crossings and nestings of matchings and partitions
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
• Dyck paths and pattern-avoiding matchings
• Identities for non-crossing graphs and multigraphs
• Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
• Counting formulas of perfect matchings of two types of graphs

Cites work

• A new class of Wilf-equivalent permutations
• A spherical initial ideal for Pfaffians
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• Crossings and nestings of matchings and partitions
• Decreasing subsequences in permutations and Wilf equivalence for involutions
• Distribution of crossings, nestings and alignments of two edges in matchings and partitions
• Dyck paths and pattern-avoiding matchings
• Generalized triangulations and diagonal-free subsets of stack polyominoes
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Increasing and decreasing sequences in fillings of moon polyominoes
• On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
• On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
• Wilf-equivalence for singleton classes

Cited in

(22)

• Maximal increasing sequences in fillings of almost-moon polyominoes
• Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices
• Avoiding monotone chains in fillings of layer polyominoes
• Positive and negative chains in charged moon polyominoes
• Counting with Borel's triangle
• Pattern avoidance in matchings and partitions
• Increasing and decreasing sequences in fillings of moon polyominoes
• The combinatorics of associated Hermite polynomials
• Chains of length 2 in fillings of layer polyominoes
• Linked partitions and permutation tableaux
• Crossings and nestings in tangled diagrams
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• Vacillating Hecke tableaux and linked partitions
• Ascents and descents in 01-fillings of moon polyominoes
• Derangements on a Ferrers board
• Major index for 01-fillings of moon polyominoes
• Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
• On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
• Crossings and nestings for arc-coloured permutations and automation
• k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
• A generating tree approach to \(k\)-nonnesting partitions and permutations
• Fillings of skew shapes avoiding diagonal patterns

This page was built for publication: \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950332)