The function computes the coarsest partition of a finite sequence of sets for which only consecutive sets may overlap.
the sequence of finite sets whose coarsest partition is required. These sets must be entered in the order under which only consecutive sets may have non-empty intersection.
A list comprising the sets that make up the coarsest partition.
Kwang Woo Ahn and Kung-Sik Chan
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.