Partitions with certain intersection properties

DOI10.1002/JCD.20290MaRDI QIDQ3100729zbMATH OpenOpenAlexFDO

Authors Péter M. Gergely

Publication date 21 November 2011

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.20290

zbMATH Keywords

combinatorial constructionintersection conditionspartititons

Mathematics Subject Classification ID

Partitions of sets (05A18)

Recommendations

• A Deza-Frankl type theorem for set partitions
• Intersecting integer partitions
• Partitions, packings and coverings by families with nonempty intersections
• Intersecting k-uniform families containing all the k-subsets of a given set
• Partition-free families of sets

Cites work

• scientific article; zbMATH DE number 1542664 (Why is no real title available?)
• scientific article; zbMATH DE number 908567 (Why is no real title available?)
• scientific article; zbMATH DE number 1439445 (Why is no real title available?)
• Design type problems motivated by database theory
• Minimum matrix representation of closure operations
• On minimum matrix representation of closure operations
• On orthogonal double covers by trees
• On orthogonal double covers of graphs
• On orthogonal double covers of k_n and a conjecture of chung and west
• Orthogonal double covers of complete graphs by trees
• Orthogonal double covers of complete graphs by trees of small diameter
• Symmetric graph designs

Cited in

(13)

• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• Partitions of a set satisfying certain set of conditions
• Interval partitions and Stanley depth
• Strongly intersecting integer partitions
• Partitions with Early Conditions
• A Deza-Frankl type theorem for set partitions
• The number of unrelated partitions
• Partitions of bases into disjoint unions of bases
• Partitions, packings and coverings by families with nonempty intersections
• On the maximum number of qualitative independent partitions
• Intersecting integer partitions
• Pairs of disjoint \(q\)-element subsets far from each other
• How to construct a partition when preference sets are given

This page was built for publication: Partitions with certain intersection properties

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