scientific article; zbMATH DE number 1998302

From MaRDI portal
Publication:4432947





Let \(S_n= \{1,2,\dots,n\}\); a collection \({\mathcal P}\) of subsets of \(S_n\) is a \(d\)-partition of \(S_n\) if (1) for all \(X\in{\mathcal P}\), \(|X|\geq d\); (2) \(\bigcup_{X\in{\mathcal P}} X= S_n\); and (3) every \(d\)-element subset in \(S_n\) is contained in exactly one \(X\in{\mathcal P}\). Let \(p_n(d)\) denote the number of \(d\)-partitions of \(S_n\) and let \(p_n(d;a)\) denote the number of \(d\)-partitions of \(S_n\) whose sets contain at most \(a\) elements. The author proves several results about these numbers. For example: Theorem 3. For all \(0< d< n\), \(p_n(d)\leq 2^{{n\choose d+1}}\). Theorem 4. For all \(1< d< n\), \(p_n(d; d+1)< 2^{n+1+(n+1)^d(\log_2 e+\log_2(n- d))}\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432947)