Baker, Brenda; Shostak, Robert Gossips and telephones. (English) Zbl 0245.05002 Discrete Math. 2, 191-193 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 44 Documents MSC: 05A05 Permutations, words, matrices PDF BibTeX XML Cite \textit{B. Baker} and \textit{R. Shostak}, Discrete Math. 2, 191--193 (1972; Zbl 0245.05002) Full Text: DOI OpenURL Online Encyclopedia of Integer Sequences: Gossip Problem: there are n people and each of them knows some item of gossip not known to the others. They communicate by telephone and whenever one person calls another, they tell each other all that they know at that time. How many calls are required before each gossip knows everything? References: [1] Hajnal, A.; Milner, F.C.; Szemerédi, E., A cure for the telephone disease, () · Zbl 0251.05132 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.