Strongly intersecting integer partitions

DOI10.1016/J.DISC.2014.07.018MaRDI QIDQ740661zbMATH OpenOpenAlexFDO

Authors Peter Borg

Publication date 4 September 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.6563

zbMATH Keywords

intersecting familyinteger partitionstrongly intersecting set

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Abstract: If $a_1,a_2,\mathrm{...},a_k$ and $n$ are positive integers such that $n=a_1+a_2+\mathrm{...}+a_k$, then the sum $a_1+a_2+\mathrm{...}+a_k$ is said to be a emph{partition of $n$} of emph{length $k$}, and $a_1,a_2,\mathrm{...},a_k$ are said to be the emph{parts} of the partition. Two partitions that differ only in the order of their parts are considered to be the same. We say that two partitions emph{intersect} if they have at least one common part. We call a set $A$ of partitions emph{intersecting} if any two partitions in $A$ intersect. Let $P_{n,k}$ be the set of all partitions of $n$ of length $k$. We conjecture that if $2leqkleqn$, then the size of any intersecting subset of $P_{n,k}$ is at most the size of $P_{n-1,k-1}$, which is the size of the intersecting subset of $P_{n,k}$ consisting of those partitions which have 1 as a part. The conjecture is trivially true for $nleq2k$, and we prove it for $ngeq5k^5$. We also generalise this for subsets of $P_{n,k}$ with the property that any two of their members have at least $t$ common parts.

Recommendations

• Intersecting integer partitions
• On Intersecting Properties of Partitions of Integers
• Partitions with certain intersection properties
• scientific article; zbMATH DE number 2126631
• The strong intersecting number of a graph
• Strong sequences and partition relations
• LATIN 2004: Theoretical Informatics
• Integer partitions and the Sperner property
• STRONG COLORINGS OVER PARTITIONS

Cites work

• scientific article; zbMATH DE number 2126631 (Why is no real title available?)
• scientific article; zbMATH DE number 5130735 (Why is no real title available?)
• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3461973 (Why is no real title available?)
• scientific article; zbMATH DE number 3472087 (Why is no real title available?)
• scientific article; zbMATH DE number 3477225 (Why is no real title available?)
• scientific article; zbMATH DE number 3619902 (Why is no real title available?)
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• scientific article; zbMATH DE number 3636041 (Why is no real title available?)
• scientific article; zbMATH DE number 1795862 (Why is no real title available?)
• scientific article; zbMATH DE number 863493 (Why is no real title available?)
• scientific article; zbMATH DE number 5590048 (Why is no real title available?)
• A Group-Theoretic Setting for Some Intersecting Sperner Families
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• A new result on Chvátal's conjecture
• A simple proof of the Erdős-Chao Ko-Rado theorem
• An Erdős--Ko--Rado theorem for partial permutations
• An Erdős-Ko-Rado theorem for signed sets
• An Erdős-Ko-Rado theorem for the subcubes of a cube
• An Erdős-Ko-Rado-type theorem in Coxeter groups.
• An intersection theorem for weighted sets
• An ordered version of the Erdős-Ko-Rado theorem
• Compression and Erdős-Ko-Rado graphs
• Cross-intersecting families and primitivity of symmetric systems
• Erdös–Ko–Rado Theorem—22 Years Later
• Erdős-Ko-Rado from Kruskal-Katona
• Erdős-Ko-Rado theorems for chordal graphs and trees
• Erdős-Ko-Rado theorems for permutations and set partitions
• Erdős-Ko-Rado theorems for simplicial complexes
• Erdős-Ko-Rado-type theorems for colored sets
• Extremal t -intersecting sub-families of hereditary families
• Graphs with the Erdős-Ko-Rado property
• INTERSECTING FAMILIES OF SEPARATED SETS
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting and cross-intersecting families of labeled sets
• Intersecting families of permutations
• Intersecting families of permutations
• Intersecting systems of signed sets
• Intersection theorems for systems of finite sets
• Intersection theorems for systems of finite vector spaces
• Katona's intersection theorem: four proofs
• More on the Erdős-Ko-Rado theorem for integer sequences
• On Chvàtal's conjecture and a conjecture on families of signed sets
• On t-intersecting families of signed sets and permutations
• On a combinatorial conjecture of Erdös
• On the maximum number of permutations with given maximal or minimal distance
• Some Erdős-Ko-Rado theorems for injections
• Stable sets of maximal size in Kneser-type graphs
• The Erdös-Ko-Rado Theorem for Integer Sequences
• The Erdős-Ko-Rado bound for the function lattice
• The Erdős-Ko-Rado properties of set systems defined by double partitions
• The Erdős-Ko-Rado properties of various graphs containing singletons
• The Erdős-Ko-Rado theorem for integer sequences
• The Erdős-Ko-Rado theorem for vector spaces
• The complete intersection theorem for systems of finite sets
• The diametric theorem in Hamming spaces---optimal anticodes
• 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

(5)

• New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
• The maximum product of sizes of cross-intersecting families
• Intersecting integer partitions
• Erdös-Ko-Rado theorems for a family of trees
• A sharp bound for the product of weights of cross-intersecting families

This page was built for publication: Strongly intersecting integer partitions

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