A product version of the Hilton-Milner-Frankl theorem

DOI10.1007/S11425-022-2061-YarXiv2206.07217WikidataQ123231540 ScholiaQ123231540MaRDI QIDQ6151835FDOQ6151835

Authors: Peter Frankl, Jian Wang 

Publication date: 12 February 2024

Published in: Science China. Mathematics (Search for Journal in Brave)

Abstract: Two families $mathcalF,mathcalG$ of $k$-subsets of $1,2,ldots,n$ are called non-trivial cross $t$-intersecting if $|FcapG|geqt$ for all $FinmathcalF,GinmathcalG$ and $|capFcolonFinmathcalF|<t$, $|capGcolonGinmathcalG|<t$. In the present paper, we determine the maximum product of the sizes of two non-trivial cross $t$-intersecting families of $k$-subsets of $1,2,ldots,n$ for $ngeq4(t+2{)}^2{k}^2$, $kgeq5$, which is a product version of the Hilton-Milner-Frankl Theorem.

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

Recommendations

• A product version of the Hilton-Milner theorem
• A note on the maximum product-size of non-trivial cross \(t\)-intersecting families
• The maximum product of sizes of cross-\(t\)-intersecting uniform families
• The maximum product of sizes of cross-intersecting families
• Some best possible inequalities concerning cross-intersecting families

zbMATH Keywords

extremal set theoryproduct versionnon-trivialcross \(t\)-intersecting family

Mathematics Subject Classification ID

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?)
• The exact bound in the Erdős-Ko-Rado theorem
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Erdős-Ko-Rado from Kruskal-Katona
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Shadows and intersections: Stability and new proofs
• A new short proof for the Kruskal-Katona theorem
• A new generalization of the Erdős-Ko-Rado theorem
• An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
• On intersecting families of finite sets
• Title not available (Why is that?)

Cited In (2)

• Nearly extremal non-trivial cross \(t\)-intersecting families and \(r\)-wise \(t\)-intersecting families
• Improved bounds concerning the maximum degree of intersecting hypergraphs

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

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