In combinatorics, a laminar set family is a set family in which each pair of sets are either disjoint or related by containment.
Definition Formally, a set family F = { S 1 , S 2 , … } {\displaystyle {\mathcal {F}}=\{S_{1},S_{2},\ldots \}} is called laminar if for every i , j {\displaystyle i,j} , the intersection S i ∩ S j {\displaystyle S_{i}\cap S_{j}} is either empty, or equals S i {\displaystyle S_{i}} , or equals S j {\displaystyle S_{j}} .
Construction and Properties Let E {\displaystyle E} be a ground-set of elements. A laminar set-family on E {\displaystyle E} can be constructed by recursively partitioning E {\displaystyle E} into parts and sub-parts. The singleton family E {\displaystyle {E}} is laminar. If we partition E {\displaystyle E} into some k {\displaystyle k} pairwise-disjoint parts E 1 , … , E k {\displaystyle E_{1},\ldots ,E_{k}} , then E , E 1 , … , E k {\displaystyle {E,E_{1},\ldots ,E_{k}}} is laminar too. If we now partition, say E 1 {\displaystyle E_{1}} into E 11 , E 12 , … , E 1 j {\displaystyle E_{11},E_{12},\ldots ,E_{1j}} , then adding these sub-parts yields another laminar family, and so on. Hence, a laminar set-family can be seen as a hierarchical partitioning of the ground-set into categories and sub-categories. A fundamental property of laminar set families is that they can be represented as a rooted tree where each node corresponds to a set in the family, and a set S i {\displaystyle S_{i}} is an ancestor of S j {\displaystyle S_{j}} if and only if S i ⊃ S j {\displaystyle S_{i}\supset S_{j}} . This tree representation makes laminar families particularly useful in algorithm design, as many problems can be solved efficiently using dynamic programming on the tree structure.
Applications
Hypergraphs The notion of laminarity can be applied to hypergraphs to define "laminar hypergraphs" as those whose set of hyperedges forms a laminar set family.
Planar Graph Decomposition Laminar families of separators play a crucial role in decomposing planar graphs. A k-separator (or k-cutset) in a k-connected graph is a subset of k vertices whose deletion disconnects the remaining graph. For planar graphs, the separators of small size often naturally form laminar families, which enables efficient algorithmic solutions. Eppstein and Reed showed that for a 3-connected planar graph G {\displaystyle G} , a maximal set of laminar 3-separators can be found in linear time. This is non-trivial because some planar graphs like wheel graphs can have Θ ( n 2 ) {\displaystyle \Theta (n^{2})} 3-separators and Θ ( n 4 ) {\displaystyle \Theta (n^{4})} non-laminar pairs of 3-separators, making it inefficient to enumerate all separators and then select a laminar subset. Their algorithm works by transforming the problem: 3-separators in the original graph G {\displaystyle G} correspond to certain 6-cycles in the barycentric subdivision BCS ( G ) {\displaystyle {\text{BCS}}(G)} . The algorithm identifies "frames" (wheel-like structures containing many mutually non-laminar cycles) and handles them separately to avoid quadratic blow-up in complexity. This decomposition has important applications in finding disjoint paths in graphs and computing tree decompositions of bounded adhesion. Beginning with the work of Wagner, decompositions of graphs by laminar sets of small cutsets have been an important tool in graph structure theory. Wagner showed that every K 5 {\displaystyle K_{5}} -minor-free graph can be decomposed by a laminar system of cutsets of size at most three into pieces that are either planar or the eight-vertex Wagner graph. Many similar decomposition theorems are now known, and tree decompositions and treewidth are also defined by laminar cutsets.
References
