Gossiping in a complete graph $f(n)=2n-4$

<aside>

Question: How many temporal edges/labels are necessary to make a graph TC?

</aside>

[4] B. Baker and R. Shostak, Gossips and telephones. Discr. Math. 2 (1972) 191-193. [13] R. Bumby, A problem with telephones. SIAM J. Afg.Disc. Meth. 2(1981)18-13. [64] A. Hajnal, E. C. Milner and E. Szemeredi, A cure for the telephone disease. Canad. Math Bull. 15 (1972) 447450. [114] A Seress, Quick gossiping without duplicate transmissions. Graphs and Combinatorics [121] R. Tijdeman, On a telephone problem. Nieuw Arch. Wisk. 19 (1971) 188-192.