Union-intersecting set systems

DOI10.1007/S00373-014-1456-7zbMath1327.05327arXiv1403.0088OpenAlexW1978040023MaRDI QIDQ497346

Dániel T. Nagy

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremforbidden subposets\(\Delta\)-systemextremal set systems

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (4)

Size and structure of large \((s,t)\)-union intersecting families ⋮ Stability results for vertex Turán problems in Kneser graphs ⋮ Around the complete intersection theorem ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The complete intersection theorem for systems of finite sets
• Posets, homomorphisms and homogeneity
• Exact solution of some Turán-type problems
• Beyond the Erdős-Ko-Rado theorem
• Largest families without an \(r\)-fork
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On families of finite sets no two of which intersect in a singleton
• Intersection theorems for systems of finite sets

This page was built for publication: Union-intersecting set systems