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

DOI10.1006/JCTA.1997.2795MaRDI QIDQ1369741zbMATH OpenOpenAlexFDO

Authors Vojtěch Rödl, Luboš 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

constructionErdös-Rado's theoremweak \(\Delta\)-system

Mathematics Subject Classification ID

Extremal set theory (05D05)

Review text

The paper proves an improved lower bound to the maximum size of set systems without \(r\)-element weak \(\Delta\)-systems on the \(n\)-element underlying set, namely this maximum size is \(\geq 2^{(1/3)n^{1/5}\log^{4/5}(r-1)}\). The proof is constructive.

Recommendations

• On large systems of sets with no large weak \(\Delta\)-subsystems
• On set systems not containing delta systems
• A note on weak delta systems
• Intersection statements for systems of sets

Cites work

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

Cited in

(8)

• On set systems not containing delta systems
• Combinatorial properties of systems of sets
• On large systems of sets with no large weak \(\Delta\)-subsystems
• A simple proof of optimal epsilon nets
• A note on weak delta systems
• A problem of Laczkovich: how dense are set systems with no large independent sets?
• scientific article; zbMATH DE number 1919511 (Why is no real title available?)
• Upper bounds for families without weak delta-systems

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

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