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

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.26493/1855-3974.2698.6FE" rel="nofollow">DOI 10.26493/1855-3974.2698.6FE</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1515.05179" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://www.wikidata.org/wiki/Q123120323" rel="nofollow"><img src="https://www.wikidata.org/static/favicon/wikidata.ico" class="pub-badge-icon" alt=""/>Wikidata</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q6158904" rel="nofollow">MaRDI QID Q6158904</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q6158904" rel="nofollow">FDO</a>

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

Publication date 31 May 2023

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

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

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)

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$.

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

Cites work

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 1420985 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A new strongly regular graph
• An Erdős-Ko-Rado theorem for finite 2-transitive groups
• An Erdős-Ko-Rado theorem for the derangement graph of \(\mathrm{PGL}_3(q)\) acting on the projective plane
• An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
• Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\)
• Erdős-Ko-Rado for perfect matchings
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Erdős-Ko-Rado theorems. Algebraic approaches
• Hoffman's ratio bound
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting families of permutations
• Multiplicity-free permutation representations of the symmetric group.
• Representation theory of the symmetric groups. The Okounkov-Vershik approach, character formulas, and partition algebras.
• Setwise intersecting families of permutations
• The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
• The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
• The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space
• The asymptotic number of non-negative integer matrices with given row and column sums
• The exact bound in the Erdős-Ko-Rado theorem

Cited in

(9)

• An Erdős--Ko--Rado theorem for partial permutations
• Erdős-Ko-Rado-type theorems for colored sets
• Erdős-Ko-Rado theorems for uniform set-partition systems
• The Erdős-Ko-Rado properties of set systems defined by double partitions
• Erdős-Ko-Rado theorems for set partitions with certain block size
• An Erdős-Ko-Rado theorem for subset partitions
• 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
• A general 2-part Erdős-Ko-Rado theorem

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)