Category:Set families

• Family of sets (computing)

A

• Abstract simplicial complex (computing)
• Almost disjoint sets (computing)
• Antimatroid (computing)

B

• Block design (computing)

C

• Clique complex (computing)
• Combinatorial design (computing)
• Content (measure theory) (computing)

D

• Dedekind number (computing)
• Delta-ring (computing)
• Disjoint sets (computing)
• Dynkin system (computing)

E

• Erdős–Ko–Rado theorem (computing)
• Extremal Problems For Finite Sets (computing)

F

• Field of sets (computing)
• Finite character (computing)
• Finite intersection property (computing)
• Fisher's inequality (computing)

G

• Generalized quadrangle (computing)
• Generated σ-algebra (by sets) (computing)
• Greedoid (computing)
• Growth function (computing)

H

• Helly family (computing)

I

• Incidence structure (computing)

K

• Kirkman's schoolgirl problem (computing)
• Kruskal–Katona theorem (computing)

L

• Levi graph (computing)
• Lubell–Yamamoto–Meshalkin inequality (computing)

M

• Matroid (computing)
• Maximum coverage problem (computing)
• Monotone class theorem (computing)

N

• Near polygon (computing)
• Noncrossing partition (computing)

P

• Partition of a set (computing)
• Partition regularity (computing)
• Pi-system (computing)
• Polar space (computing)
• Predictable σ-algebra (computing)
• Product σ-algebra (computing)
• Property B (computing)

R

• Ring of sets (computing)

S

• Sauer–Shelah lemma (computing)
• Separable σ-algebra (computing)
• Set cover problem (computing)
• Sigma-algebra (computing)
• Sigma-ideal (computing)
• Sigma-ring (computing)
• Sperner family (computing)
• Sperner's theorem (computing)
• Steiner system (computing)

T

• Teichmüller–Tukey lemma (computing)
• Two-graph (computing)

U

• Ultrafilter (computing)
• Union-closed sets conjecture (computing)
• Universal set (computing)
• Universe (mathematics) (computing)

Σ

• Σ-algebra (computing)
• Σ-Algebra of τ-past (computing)