We study the classical randomized rumour spreading protocol push. Initially, a node in graph possesses some information, which is then spread round based manner. In each round, informed chooses uniformly at random one of its neighbours and passes information to it. The central quantity interest runtime, that is, number rounds needed until every has received information. push variations it have ...