Parity biases in partitions and restricted partitions (Q2136205)

\textit{B. Kim} et al. [Eur. J. Comb. 89, Article ID 103159, 18 p. (2020; Zbl 1447.05030)] proved that \(p_o(n) > p_e(n)\) and conjectured that \(d_o(n) > d_e(n)\) for all \(n > 19\) where: \begin{itemize} \item \(p_o(n)\) (resp. \(p_e(n)\)) denote the number of partitions of \(n\) with more odd parts (resp. even parts) than even parts (resp. odd parts) \item \(d_o(n)\) (resp. \(d_e(n)\)) denote the number of partitions into distinct parts having more odd parts (resp. even parts) than even parts (resp. odd parts). \end{itemize} In this paper, the authors prove these two inequalities combinatorially.