Some best possible bounds concerning the traces of finite sets. II
Let \(X\) be an \(n\)-element set and \({\mathcal F}\) be a family of subsets of \(X\). For the subset \(Y\subseteq X\) denote \({\mathcal F}_Y\) the trace of \(\mathcal F\) on \(Y\). For the positive integers \(m\), \(n\), \(r\), \(s\) the arrow relation \((m, n)\to (r, s)\) means that whenever \(|{\mathcal F}|\geq m\), one can find an \(s\)-element subset \(Y\subseteq X\) such that \(|{\mathcal F}_Y|\geq r\) holds. This paper proves the arrow relations \((m, n)\to (m- 10, n- 1)\) for \(m\leq 5n\) and \((m, n)\to (m- 13, n- 1)\) for \(m\leq \lceil 29n/5\rceil\), and these are best possible results. The proofs are based on a result of P. Frankl on complexes and a generalized Kruskal-Katona theorem. For the first part see the author and \textit{P. Frankl} [ibid. 10, No. 3, 283-292 (1994; Zbl 0817.05073)].
- Some best possible bounds concerning the traces of finite sets
- scientific article; zbMATH DE number 3887691
- On extremal problems concerning the traces of sets
- scientific article; zbMATH DE number 736296
- Fréchet-Urysohn for finite sets, II
- Embeddings and the trace of finite sets
- A note on traces of set families
- Bounds in the theory of finite covers
- On Trace Sets of Restricted Continued Fraction Semigroups
- The best bounds in a theorem of Russell Lyons
This page was built for publication: Some best possible bounds concerning the traces of finite sets. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900526)
