Intersection theorems and a lemma of Kleitman

DOI10.1016/0012-365X(76)90097-2zbMath0349.05006OpenAlexW2056573971WikidataQ124821643 ScholiaQ124821643MaRDI QIDQ1234692

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

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• On incomparable collections of sets
• Intersection theorems for systems of finite sets
• Families of Non-disjoint subsets