On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems

DOI10.1006/jcta.1997.2795zbMath0882.05121OpenAlexW2036715313MaRDI QIDQ1369741

Vojtěch Rödl, Lubos Thoma

Publication date: 1 February 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2795

zbMATH Keywords

constructionweak \(\Delta\)-systemErdös-Rado's theorem

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• Combinatorial properties of systems of sets
• On set systems without weak 3-\(\Delta\)-subsystems
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• Forbidden Intersections
• Intersection Theorems for Systems of Sets (II)

This page was built for publication: On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems