On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems (Q1369741)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the size of set systems on [n] not containing weak (r,)-systems |
scientific article; zbMATH DE number 1076999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems |
scientific article; zbMATH DE number 1076999 |
Statements
On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems (English)
0 references
1 February 1998
0 references
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.
0 references
weak \(\Delta\)-system
0 references
construction
0 references
Erdös-Rado's theorem
0 references
0.8692373037338257
0 references
0.826039731502533
0 references
0.8203517198562622
0 references
0.8022070527076721
0 references
