Laminar set family
In combinatorics, a laminar set family is a set family in which each pair of sets are either disjoint or related by containment.[1][2] Formally, a set family {S1, S2, ...} is called laminar if for every i, j, the intersection of Si and Sj is either empty, or equals Si, or equals Sj. Let E be a ground-set of elements. A laminar set-family on E can be constructed by recursively partitioning E into parts and sub-parts. In particular, the singleton family {E} is laminar; if we partition E into some k pairwise-disjoint parts E1,...,Ek, then {E, E1,...,Ek} is laminar too; if we now partition e.g. E1 into E11, E12, ... E1j, then adding these sub-parts yields another laminar family; etc. Hence, a laminar set-family can be seen as a partitioning of the ground-set into categories and sub-categories.
References
- ↑ Cheriyan, Joseph; Jordán, Tibor; Ravi, R. (1999). Nešetřil, Jaroslav. ed. "On 2-Coverings and 2-Packings of Laminar Families" (in en). Algorithms - ESA' 99. Lecture Notes in Computer Science (Berlin, Heidelberg: Springer) 1643: 510–520. doi:10.1007/3-540-48481-7_44. ISBN 978-3-540-48481-3. https://link.springer.com/chapter/10.1007/3-540-48481-7_44.
- ↑ Maduel, Yael; Nutov, Zeev (2010-07-06). "Covering a laminar family by leaf to leaf links" (in en). Discrete Applied Mathematics 158 (13): 1424–1432. doi:10.1016/j.dam.2010.04.002. ISSN 0166-218X. https://www.sciencedirect.com/science/article/pii/S0166218X10001356.
 |
