A general 2-part Erdős-Ko-Rado theorem

DOI10.7494/OPMATH.2017.37.4.577MaRDI QIDQ4690987zbMATH OpenFDO

Authors Gyula O. H. Katona

Publication date 23 October 2018

Published in Opuscula Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

extremal set theoryintersecting familytwo part problem

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: A two-part extension of the famous ErdH{o}s-Ko-Rado Theorem is proved. The underlying set is partitioned into $X_1$ and $X_2$. Some positive integers $k_i,el{l}_i(1leqileqm)$ are given. We prove that if $calF$ is an intersecting family containing members $F$ such that $|Fcap{X}_1|=k_i,|Fcap{X}_2|=el{l}_i$ holds for one of the values $i(1leqileqm)$ then $|calF|$ cannot exceed the size of the largest subfamily containing one element.

Recommendations

• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• A bipartite Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem
• Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem
• A new generalization of the Erdős-Ko-Rado theorem

Cites work

• A simple proof of the Erdős-Chao Ko-Rado theorem
• An Erdös-Ko-Rado theorem for direct products
• scientific article; zbMATH DE number 3230288 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On a lemma of Littlewood and Offord on the distribution of certain sums
• Some intersection theorems
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Cited in

(33)

• Families intersecting on an interval
• The Erdős-Ko-Rado properties of set systems defined by double partitions
• A construction for large families of k-element sets having the Erdős intersection property
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Some intersection theorems
• Regular bipartite graphs and intersecting families
• A degree version of the Hilton-Milner theorem
• Non-trivially intersecting multi-part families
• The number of k-intersections of an intersecting family of r-sets
• A sharp bound for the number of sets that pairwise intersect at k positive values
• Refuting conjectures in extremal combinatorics via linear programming
• Erdős-Ko-Rado sets of flags of finite sets
• Extremal t-intersecting families for direct products
• Erdős-Ko-Rado theorem for a restricted universe
• Non-trivial \(d\)-wise intersecting families
• An Erdős-Ko-Rado theorem for subset partitions
• A Deza-Frankl type theorem for set partitions
• A bipartite Erdős-Ko-Rado theorem
• Erdős--Ko--Rado for three sets
• A Katona-type proof of an Erdős-Ko-Rado-type theorem
• Erdős-Ko-Rado theorems for uniform set-partition systems
• Erdős-Ko-Rado with separation conditions
• Partial covering arrays and a generalized Erdős-Ko-Rado property
• scientific article; zbMATH DE number 3900758 (Why is no real title available?)
• scientific article; zbMATH DE number 3991507 (Why is no real title available?)
• scientific article; zbMATH DE number 4023284 (Why is no real title available?)
• An analogue of the Erdős-Ko-Rado theorem for weak compositions
• A generalization of the Erdős-Ko-Rado theorem to t-designs in certain semilattices
• A new generalization of the Erdős-Ko-Rado theorem
• An extension of the Erdős-Ko-Rado theorem to uniform set partitions
• Some novelties on intersecting families of subsets
• Clique number of xor-powers of Kneser graphs
• An extension of a Frankl-Füredi theorem

This page was built for publication: A general 2-part Erdős-Ko-Rado theorem

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