Patrick De Causmaecker, Stefan De Wannemacker, Jay Yellen
Published 2016-02-15Version 1
An antichain of subsets is a set of subsets such that no subset in the antichain is a proper subset of any other subset in the antichain. The Dedekind number counts the total number of antichains of subsets of an n-element set. This paper investigates the interval structure of the lattice of antichains. Several partitioning theorems and counting formulas for the size of intervals are derived.
Enumeration for the total number of all spanning forests of complete tripartite graph based on the combinatorial decomposition
Enumerating the total number of subtrees of trees
What is the number of decompositions of torus into given number of regions by unions of geodesics?
![QR code for arXiv:1602.04675 [math.CO]](http://oss.arxitics.com/images/favicon.svg)