The partial gossip problem revisited

We present correct proof of G. Chung, Y.-J. Tsay result on partial gossip problem.

💡 Research Summary

The paper revisits the “partial gossip problem,” a classic model of information dissemination where each of (n) participants initially holds a unique message and a telephone call between two participants exchanges all messages known to each side. The goal is to determine the minimum number of calls, denoted (P(n,k)), required for every participant to know at least (k) messages. In 2026 Chung and Tsay claimed a complete solution:

1. If (n \ge 2^{k-1}-1) then
   \