On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
type: Item
instance of: scholarly article
title: On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
zbMATH Open document ID: 0882.05121
author: Vojtěch Rödl
author: Luboš Thoma
published in: Journal of Combinatorial Theory. Series A
publication date: 1998-02-01T00:00:00Z
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.
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 1076999
zbMATH Keywords: weak \(\Delta\)-system
zbMATH Keywords: construction
zbMATH Keywords: Erdös-Rado's theorem
reviewed by: Péter L. Erdős
MaRDI profile type: Publication
full work available at URL: jcta.1997.2795
OpenAlex ID: W2036715313
cites work: On set systems without weak 3-\(\Delta\)-subsystems
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Intersection Theorems for Systems of Sets
cites work: Intersection Theorems for Systems of Sets (II)
cites work: Combinatorial properties of systems of sets
cites work: Forbidden Intersections
DOI: 10.1006/JCTA.1997.2795
description: scientific article; zbMATH DE number 1076999