Erdős-Ko-Rado theorems for set partitions with certain block size

DOI10.1016/J.JCTA.2019.105180MaRDI QIDQ2299629zbMATH OpenOpenAlexFDO

Authors Cheng Yeaw Ku, K. B. Wong

Publication date 21 February 2020

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2019.105180

zbMATH Keywords

\(t\)-intersecting familyErdős-Ko-Radoset partitions

Mathematics Subject Classification ID

Extremal set theory (05D05)

Recommendations

• An Erdős-Ko-Rado theorem for subset partitions
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Erdős-Ko-Rado theorems for permutations and set partitions
• Erdős-Szekeres results for set partitions
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• The partitioned version of the Erdős-Szekeres theorem
• The asymptotic number of set partitions with unequal block sizes
• On the number of distinct block sizes in partitions of a set
• On the maximal multiplicity of block sizes in a random set partition
• An Erdős-Ko-Rado theorem for multisets

Cites work

• A Deza-Frankl type theorem for set partitions
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• A non-trivial intersection theorem for permutations with fixed number of cycles
• A product version of the Erdős-Ko-Rado theorem
• An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• An analogue of the Hilton-Milner theorem for set partitions
• An analogue of the Hilton-Milner theorem for weak compositions
• AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS
• An Erdős-Ko-Rado theorem for cross t-intersecting families
• An Erdős-Ko-Rado theorem for permutations with fixed number of cycles
• Erdős-Ko-Rado theorems for permutations and set partitions
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Forbidding just one intersection, for permutations
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• Intersecting families of permutations
• Intersecting families of permutations
• Intersection problems in the q-ary cube
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Multiply union families in \(\mathbb{N}^n\)
• On \(r\)-cross \(t\)-intersecting families for weak compositions
• On r-cross intersecting families of set
• On r-cross intersecting families of sets
• On cross-intersecting families of set partitions
• On intersecting families of finite sets
• Shadows and intersections in vector spaces
• Some Erdős-Ko-Rado theorems for injections
• Stability for t-intersecting families of permutations
• The complete intersection theorem for systems of finite sets
• The diametric theorem in Hamming spaces---optimal anticodes
• The Erdős-Ko-Rado theorem for vector spaces
• The exact bound in the Erdős-Ko-Rado theorem
• The maximum sum and the maximum product of sizes of cross-intersecting families

Cited in

(11)

• Partitionable sets and cyclic BSECs with block size four
• On the maximum size of Erdős-Ko-Rado sets in \(H(2d+1, q^2)\)
• An Erdős-Ko-Rado theorem for subset partitions
• Erdős-Ko-Rado theorems for uniform set-partition systems
• The Rand and Block Distances of Pairs of Set Partitions
• Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem
• On diversity of certain \(t\)-intersecting families
• Erdős-Szekeres results for set partitions
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• Diversity and intersecting theorems for weak compositions
• Erdős-Ko-Rado theorem and Hilton-Milner type theorem for k-partitions

This page was built for publication: Erdős-Ko-Rado theorems for set partitions with certain block size

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