A product version of the Hilton-Milner theorem

DOI10.1016/J.JCTA.2023.105791MaRDI QIDQ6133632zbMATH OpenWikidataFDO

Authors Peter Frankl, Jian Wang

Publication date 21 August 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

inequalitiesfinite setsErdős-Ko-Rado theoremnon-trivial intersecting

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: Two families $mathcalF,mathcalG$ of $k$-subsets of $1,2,ldots,n$ are called non-trivial cross-intersecting if $FcapGeqemptyset$ for all $FinmathcalF,GinmathcalG$ and $capFcolonFinmathcalF=emptyset=capGcolonGinmathcalG$. In the present paper, we determine the maximum product of the sizes of two non-trivial cross-intersecting families of $k$-subsets of $1,2,ldots,n$ for $ngeq4k$, $kgeq8$, which is a product version of the classical Hilton-Milner Theorem.

Recommendations

• Some best possible inequalities concerning cross-intersecting families
• Non-trivial intersecting families
• A simple proof of the Hilton-Milner theorem
• Cross-intersecting families of finite sets
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family

Cites work

• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• scientific article; zbMATH DE number 3621717 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• A generalization of a theorem of Kruskal
• A new generalization of the Erdős-Ko-Rado theorem
• A new short proof for the Kruskal-Katona theorem
• A product version of the Hilton-Milner theorem
• A simple proof of the Hilton-Milner theorem
• A size-sensitive inequality for cross-intersecting families
• Beyond the Erdős-Ko-Rado theorem
• Erdős-Ko-Rado from Kruskal-Katona
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting and cross-intersecting families of labeled sets
• Linear independence, a unifying approach to shadow theorems
• New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
• Non-trivial intersecting families
• On intersecting families of finite sets
• On separating systems of a finite set
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Shadows and intersections: Stability and new proofs
• Some best possible inequalities concerning cross-intersecting families
• THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
• The complete nontrivial-intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families

Cited in

(8)

• A product version of the Hilton-Milner-Frankl theorem
• Milnor-Wood inequalities for products
• Non-trivial intersecting families
• A note on the maximum product-size of non-trivial cross \(t\)-intersecting families
• A product version of the Hilton-Milner theorem
• Improved bounds on the maximum diversity of intersecting families
• A degree version of the Hilton-Milner theorem
• Intersecting families with covering number three

This page was built for publication: A product version of the Hilton-Milner theorem

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