scientific article; zbMATH DE number 6322891
From MaRDI portal
Publication:5494773
Recommendations
- Counting connected set partitions of graphs
- scientific article; zbMATH DE number 6813595
- scientific article; zbMATH DE number 3355040
- Enumeration of gap-bounded set partitions
- scientific article; zbMATH DE number 7310228
- Enumerating set partitions according to the number of descents of size d or more
- Enumerating consecutive and nested partitions for graphs
- scientific article; zbMATH DE number 1140232
- Enumeration of \(M\)-partitions
Cited in
(9)- Set partitions with circular successions
- scientific article; zbMATH DE number 4051632 (Why is no real title available?)
- Block-connected set partitions
- Closed expressions for averages of set partition statistics
- Counting set partitions by the number of movable letters
- Two by two squares in set partitions
- Recounting the number of rises, levels, and descents in finite set partitions
- Enumerating set partitions according to the number of descents of size d or more
- scientific article; zbMATH DE number 6813595 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494773)