No label defined (Q4938012)

A partition of the set \([m,n):=\{m,m+1,\dots,n-1\}\) (\(m\), \(n\) integers) into two parts \(A_1\), \(A_2\) is called an Erdős partition, if at least one part contains distinct elements whose sum equals \(n\). A pair \((m,n)\) is called an Erdős pair, if every partition of \([m, n)\) is an Erdős partition. It is known that for any fixed \(n\geq 12\) there exists a maximal number \(\ell_2(n)\) for \(m\), such that \((m, n)\) is an Erdős pair. \textit{B. Bollobás} and \textit{G. Jin} [Combinatorics, Paul Erdős is eighty, Bolyai Society Mathematical Studies, 79-89 (1993; Zbl 0795.05007)] proved that \(\ell_2:=\liminf_{n\to\infty}\frac{\ell_2(n)} n\) is equal to \(\frac 14\). In the present paper the author gives a simpler proof of this result. Furthermore it is shown that \(\ell_p\leq \frac 1{2p}\) holds for partitions into \(p\) parts.