An extension of the Erdős-Ko-Rado theorem to uniform set partitions

DOI10.26493/1855-3974.2698.6FEzbMATH Open1515.05179arXiv2108.07692WikidataQ123120323 ScholiaQ123120323MaRDI QIDQ6158904FDOQ6158904

Authors: K. Meagher, Mahsa N. Shirazi, Brett Stevens 

Publication date: 31 May 2023

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: A $(k,ell)$-partition is a set partition which has $ell$ blocks each of size $k$. Two uniform set partitions $P$ and $Q$ are said to be partially $t$-intersecting if there exist blocks $P_i$ in $P$ and $Q_j$ in $Q$ such that $left|P_{i}cap{Q}_{j}ight|geqt$. In this paper we prove a version of the ErdH{o}s-Ko-Rado theorem for partially $2$-intersecting $(k,ell)$-partitions. In particular, we show for $ell$ sufficiently large, the set of all $(k,ell)$-partitions in which a block contains a fixed pair is the largest set of 2-partially intersecting $(k,ell)$-partitions. For for $k=3$, we show this result holds for all $ell$.

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

Recommendations

• An Erdős-Ko-Rado theorem for subset partitions
• A general 2-part Erdős-Ko-Rado theorem
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Erdős-Ko-Rado theorems for set partitions with certain block size
• scientific article; zbMATH DE number 1420985

zbMATH Keywords

cliquequotient graphscocliqueratio boundErdős-Ko-Rado theoremuniform set partitions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Partitions of sets (05A18) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Extremal set theory (05D05)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Erdős-Ko-Rado theorem for finite 2-transitive groups
• An Erdös--Ko--Rado Theorem for the Derangement Graph of ${PGL}_3(q)$ Acting on the Projective Plane
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• The exact bound in the Erdős-Ko-Rado theorem
• Setwise intersecting families of permutations
• Representation theory of the symmetric groups. The Okounkov-Vershik approach, character formulas, and partition algebras.
• Intersecting families of permutations
• Erdős-Ko-Rado theorems for uniform set-partition systems
• The asymptotic number of non-negative integer matrices with given row and column sums
• Title not available (Why is that?)
• Multiplicity-free permutation representations of the symmetric group.
• A new strongly regular graph
• Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\)
• The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
• An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
• The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
• Erdős-Ko-Rado for perfect matchings
• Hoffman's ratio bound
• The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space

Cited In (7)

• The Erdős-Ko-Rado properties of set systems defined by double partitions
• Erdős-Ko-Rado theorems for uniform set-partition systems
• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado-type theorems for colored sets
• Erdős-Ko-Rado theorems for set partitions with certain block size
• A generalization of the Erdős-Ko-Rado theorem to \(t\)-designs in certain semilattices
• An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings

This page was built for publication: An extension of the Erdős-Ko-Rado theorem to uniform set partitions

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