This applet draws a Hasse diagram of Cobweb sub-poset levels and generates the partition of any layer <Φk → Φn> for the Natural numbers and the Fibonacci numbers. There are more different partitions of certain layer, but the proof of partition's existence gives as method to create exactly one partition of certain layer. This applet uses this method and draws it as a red blocks of the form σPm.
This is a note about the method to produce a partition of certain layer. We begin with vertices' set of m levels and we finish with set of max-disjoint blocks which create the partition of that set.
Back to Cobweb poset's main page
