Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics

From MaRDI portal
Revision as of 04:37, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:411853

DOI10.1016/j.dam.2011.07.010zbMath1239.05016arXiv1004.3220OpenAlexW2009307258MaRDI QIDQ411853

Sergey Kitaev, Jeffery B. Remmel

Publication date: 30 April 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.3220




Related Items (18)



Cites Work


This page was built for publication: Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics