On intersecting families of finite sets

DOI10.1017/S0004972700006225zbMath0425.05002WikidataQ105583846 ScholiaQ105583846MaRDI QIDQ5904248

Peter Frankl

Publication date: 1980

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

family of subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (16)

On the representing number of intersecting families ⋮ Uniform intersecting families with covering number four ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ Triangles in intersecting families ⋮ Stability of intersecting families ⋮ Uniform intersecting families with large covering number ⋮ The structure of maximal non-trivial \(d\)-wise intersecting uniform families with large sizes ⋮ The structure of large intersecting families ⋮ Covers in 4-uniform intersecting families with covering number three ⋮ Invitation to intersection problems for finite sets ⋮ The structure of large non-trivial \(t\)-intersecting families of finite sets ⋮ Tight bounds for Katona's shadow intersection theorem ⋮ The unbalance of set systems ⋮ Matchings and covers in hypergraphs ⋮ The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: On intersecting families of finite sets