Efficient Communication by Phone Calls
- 1 December 1973
- journal article
- research article
- Published by Wiley in Studies in Applied Mathematics
- Vol. 52 (4) , 345-358
- https://doi.org/10.1002/sapm1973524345
Abstract
We are given the question: how many phone calls are needed for n people to pool all their information in a succession of k‐person party line phone calls? The question was proposed by Erdös for the special case K = 2. We prove here the result that [n − 2/K − 1] + [n − 1 /k] + 1 calls are required if 1 ≤ n ≤ k2, while 2[n − 2/k − 1] are required for n > k2.Keywords
This publication has 1 reference indexed in Scilit:
- Gossips and telephonesDiscrete Mathematics, 1972