On the symmetry of the distribution of k-crossings and k-nestings in graphs
From MaRDI portal
Publication:870048
Recommendations
- k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
- \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
- On k-crossings and k-nestings of permutations
- Crossings and nestings of matchings and partitions
- \(k\)-distant crossings and nestings of matchings and partitions
Cited in
(14)- Maximal increasing sequences in fillings of almost-moon polyominoes
- Avoiding monotone chains in fillings of layer polyominoes
- Embedding dualities for set partitions and for relational structures
- Positive and negative chains in charged moon polyominoes
- \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
- Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović
- Chains of length 2 in fillings of layer polyominoes
- On k-crossings and k-nestings of permutations
- Vacillating Hecke tableaux and linked partitions
- Ascents and descents in 01-fillings of moon polyominoes
- Hecke insertion and maximal increasing and decreasing sequences in fillings of stack polyominoes
- 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: On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870048)
