On set systems not containing delta systems
Denote \(\varphi(n,k)\) the least integer such that every \(n\)-uniform hypergraph having at least \(\varphi(n,k)\) edges contains an \(k\)-element (strong) delta system. (The existence of such a function is guaranteed by the well-known Erdős-Rado theorem [J. Lond. Math. Soc. 35, 85--90 (1960; Zbl 0103.27901)].) This paper contains some concrete constructions (for small pairs of \((n,k))\) improving the lower bound for \(\varphi(n,k)\), as well as the analogue lower bound for weak delta systems. The constructions were produced by both analytical and computational methods.
- Intersection statements for systems of sets
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
- On Systems of Small Sets with No Large Δ-Subsystems
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
- Solution of a delta-system decomposition problem
- Intersection statements for systems of sets
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
- A note on weak delta systems
- On Systems of Small Sets with No Large Δ-Subsystems
- scientific article; zbMATH DE number 1420988 (Why is no real title available?)
- Upper bounds for families without weak delta-systems
This page was built for publication: On set systems not containing delta systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187943)
