Structure and enumeration of \((3+1)\)-free posets
From MaRDI portal
Publication:2256977
DOI10.1007/s00026-014-0249-2zbMath1307.05011arXiv1303.3652OpenAlexW3100074001MaRDI QIDQ2256977
Mathieu Guay-Paquet, Alejandro H. Morales, Eric S. Rowland
Publication date: 23 February 2015
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.3652
Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)
Related Items (3)
Catalan pairs and Fishburn triples ⋮ Finding balance: split graphs and related classes ⋮ Hereditary semiorders and enumeration of semiorders by dimension
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of graded (3+1)-avoiding posets
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Counting \(\mathbf {(3+1)}\)-avoiding permutations
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Counting unlabeled structures
- Total nonnegativity and (3+1)-free posets
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- A symmetric function generalization of the chromatic polynomial of a graph
- Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
- An Asymptotic Expansion for the Coefficients of Some Formal Power Series
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Structure and enumeration of (3+1)-free posets (extended abstract)
- Inhomogeneous sorting
- A characterization of \((3+1)\)-free posets
This page was built for publication: Structure and enumeration of \((3+1)\)-free posets
