Counting proper mergings of chains and antichains
From MaRDI portal
Publication:2449169
DOI10.1016/j.disc.2014.03.020zbMath1288.05021arXiv1206.3922OpenAlexW2043429610MaRDI QIDQ2449169
Publication date: 6 May 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3922
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairs of noncrossing free Dyck paths and noncrossing partitions
- Merging Ordered Sets
- Towards an Error-Tolerant Construction of $\mathcal{EL}^\bot$ -Ontologies from Data Using Formal Concept Analysis
- The On-Line Encyclopedia of Integer Sequences
This page was built for publication: Counting proper mergings of chains and antichains