| Autor: |
Joel Lewis Brewster, Yan X Zhang |
| Jazyk: |
angličtina |
| Rok vydání: |
2012 |
| Předmět: |
|
| Zdroj: |
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR,..., Iss Proceedings (2012) |
| Druh dokumentu: |
article |
| ISSN: |
1365-8050 |
| DOI: |
10.46298/dmtcs.3019 |
| Popis: |
The notion of (3+1)-avoidance appears in many places in enumerative combinatorics, but the natural goal of enumerating all (3+1)-avoiding posets remains open. In this paper, we enumerate \emphgraded (3+1)-avoiding posets. Our proof consists of a number of structural theorems followed by some generating function magic. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
