k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
DOI10.1007/S00493-007-2297-2zbMATH Open1164.05002OpenAlexW2048313572MaRDI QIDQ950332FDOQ950332
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
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
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)
Cites Work
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Distribution of crossings, nestings and alignments of two edges in matchings and partitions
- Crossings and nestings of matchings and partitions
- On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- A new class of Wilf-equivalent permutations
- Wilf-equivalence for singleton classes
- On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings
- 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
- Decreasing subsequences in permutations and Wilf equivalence for involutions
- Dyck paths and pattern-avoiding matchings
Cited In (19)
- Positive and negative chains in charged moon polyominoes
- Increasing and decreasing sequences in fillings of moon polyominoes
- Chains of length 2 in fillings of layer polyominoes
- Linked partitions and permutation tableaux
- Avoiding monotone chains in fillings of layer polyominoes
- Ascents and descents in 01-fillings of moon polyominoes
- Counting with Borel's triangle
- Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices
- Major index for 01-fillings of moon polyominoes
- k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
- Pattern avoidance in matchings and partitions
- Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
- Maximal increasing sequences in fillings of almost-moon polyominoes
- Vacillating Hecke tableaux and linked partitions
- A generating tree approach to \(k\)-nonnesting partitions and permutations
- Crossings and nestings for arc-coloured permutations and automation
- Derangements on a Ferrers board
- Fillings of skew shapes avoiding diagonal patterns
- The combinatorics of associated Hermite polynomials
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)
