A product version of the Hilton-Milner theorem

DOI10.1016/J.JCTA.2023.105791zbMATH Open1519.05240arXiv2206.07218WikidataQ122595030 ScholiaQ122595030MaRDI QIDQ6133632FDOQ6133632

Authors: Peter Frankl, Jian Wang 

Publication date: 21 August 2023

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

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.

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

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

Cited In (7)

• 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)