A Tight Upper Bound on Acquaintance Time of Graphs

Full Text

In this note we confirm a conjecture raised by Benjamini et al. (SIAM J Discrete Math 28(2):767---785, 2014) on the acquaintance time of graphs, proving that for all graphs G with n vertices it holds that $\\mathcal {AC}(G) = O(n^{3/2})$AC(G)=O(n3/2). This is done by proving that for all graphs G with n vertices and maximum degree $\\v...More