On the size of set systems on [n] not containing weak (r,)-systems
From MaRDI portal
Publication:1369741
DOI10.1006/JCTA.1997.2795zbMATH Open0882.05121OpenAlexW2036715313MaRDI QIDQ1369741FDOQ1369741
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
Recommendations
constructionweak \(\Delta\)-system[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Rado%27s+theorem&go=Go Erd��s-Rado's theorem]
Cites Work
Cited In (6)
- On large systems of sets with no large weak \(\Delta\)-subsystems
- A problem of Laczkovich: how dense are set systems with no large independent sets?
- Title not available (Why is that?)
- On set systems not containing delta systems
- Combinatorial properties of systems of sets
- A simple proof of optimal epsilon nets
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)