Intersection theorems and a lemma of Kleitman

DOI10.1016/0012-365X(76)90097-2MaRDI QIDQ1234692zbMATH OpenOpenAlexWikidataFDO

Authors Ian Anderson

Publication date 1976

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(76)90097-2

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites work

• Families of Non-disjoint subsets
• scientific article; zbMATH DE number 3460281 (Why is no real title available?)
• scientific article; zbMATH DE number 3467166 (Why is no real title available?)
• Intersection theorems for systems of finite sets
• On incomparable collections of sets

Cited in

(11)

• An intersection-union theorem for integer sequences
• The number of meets between two subsets of a lattice
• Inequalities for a pair of maps S S S with S a finite set
• On maximal families of subsets of a finite set
• Towards characterizing equality in correlation inequalities
• A Hierarchy of Inequalities
• An inequality for the weights of two families of sets, their unions and intersections
• The maximum size of intersecting and union families of sets
• Two results on set families: sturdiness and intersection
• Invitation to intersection problems for finite sets
• An inequality for partially ordered sets

This page was built for publication: Intersection theorems and a lemma of Kleitman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1234692)