Given an r $$ -edge-colored complete graph K n {K}_n , how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well-known essentially equivalent formulation of the classical Ryser's conjecture which, despite lot attention over last 50 years, still remains open. A number recent papers consider sparse random analogue this question, as...