Short proofs of three results about intersecting systems

DOI10.5070/C64163841zbMATH Open1547.05295MaRDI QIDQ6615491

William Linz, József Balogh

Publication date: 8 October 2024

Published in: Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

graph intersectionHilton-Milnernontrivial intersecting familyforbidden intersection

Mathematics Subject Classification ID

Extremal set theory (05D05) Extremal combinatorics (05D99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A product version of the Erdős-Ko-Rado theorem
• The complete intersection theorem for systems of finite sets
• Invitation to intersection problems for finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• An extremal set theoretical characterization of some Steiner systems
• The maximum size of 3-wise \(t\)-intersecting families
• On the measure of intersecting families, uniqueness and stability
• Intersection theorems with geometric consequences
• Multiply-intersecting families
• Families of finite sets satisfying a union condition
• The complete nontrivial-intersection theorem for systems of finite sets
• Refuting conjectures in extremal combinatorics via linear programming
• An improved universal bound for \(t\)-intersecting families
• Non-trivial \(d\)-wise intersecting families
• Triangle-intersecting families of graphs
• Weighted non-trivial multiply intersecting families
• The probabilistic method
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
• Specified intersections
• The structure of large intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Extremal Problems for Finite Sets
• Intersection theorems for systems of finite sets
• Set Systems with No Singleton Intersection
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A finite set covering theorem
• A pushing-pulling method: New proofs of intersection theorems
• \(K_4\)-intersecting families of graphs
• The maximum measure of non-trivial 3-wise intersecting families
• Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New

Related Items (1)

Stabilities for non-uniform \(t\)-intersecting families

This page was built for publication: Short proofs of three results about intersecting systems

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