The structure of maximal non-trivial d-wise intersecting uniform families with large sizes

DOI10.1016/J.DISC.2023.113533MaRDI QIDQ6172282zbMATH OpenOpenAlexFDO

Authors Menglong Zhang, Tao Feng

Publication date 19 July 2023

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(\Delta\)-system method\(d\)-wise intersecting familymaximalitynon-triviality

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: For a positive integer $dgeq2$, a family $$ is said to be d-wise intersecting if $|F_{1}cap{F}_{2}capdotscap{F}_d|geq1$ for all $F_1,F_2,dots,F_{d}inmathcalF$. A d-wise intersecting family $$ is called maximal if $mathcalFcupA$ is not d-wise intersecting for any $$. We provide a refinement of O'Neill and Verstra"{e}te's Theorem about the structure of the largest and the second largest maximal non-trivial d-wise intersecting k-uniform families. We also determine the structure of the third largest and the fourth largest maximal non-trivial d-wise intersecting k-uniform families for any $k>d+1geq4$, and the fifth largest and the sixth largest maximal non-trivial 3-wise intersecting k-uniform families for any $kgeq5$, in the asymptotic sense. Our proofs are applications of the $Delta$-system method.

Recommendations

• Size and structure of large \((s,t)\)-union intersecting families
• The structure of large non-trivial \(t\)-intersecting families of finite sets
• Non-trivial \(d\)-wise intersecting families
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
• Uniform intersecting families with large covering number
• The maximum product of sizes of cross-t-intersecting uniform families
• On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
• On large intersecting subfamilies of uniform setfamilies
• Non-trivial r-wise intersecting families
• A note on large H-intersecting families

Cites work

• A Combinatorial Theorem
• A pushing-pulling method: New proofs of intersection theorems
• scientific article; zbMATH DE number 4029608 (Why is no real title available?)
• Intersection Properties of Systems of Finite Sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• Non-trivial \(d\)-wise intersecting families
• On intersecting families of finite sets
• On intersecting families of finite sets
• On Sperner families satisfying an additional condition
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Stability analysis for \(k\)-wise intersecting families
• The complete intersection theorem for systems of finite sets
• The complete nontrivial-intersection theorem for systems of finite sets
• The maximum measure of 3-wise t-intersecting families
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
• The structure of large intersecting families
• The structure of large non-trivial \(t\)-intersecting families of finite sets

Cited in

(5)

• The structure of large non-trivial \(t\)-intersecting families of finite sets
• Structural results for conditionally intersecting families and some applications
• The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
• On large intersecting subfamilies of uniform setfamilies
• Short proofs of three results about intersecting systems

This page was built for publication: The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes

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