Laminar set family
id:
laminar-set-family-202-16989302
title:
Laminar set family
text:
In combinatorics, a laminar set family is a set family in which each pair of sets are either disjoint or related by containment. 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 pair
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Laminar_set_family
date created:
date modified:
2023-11-27T23:54:04Z
main entity:
{"identifier":"Q104868956","url":"https://www.wikidata.org/entity/Q104868956"}
image:
fields total:
13
integrity:
13