Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture for the K_5 running time
Statement
Let denote the maximum running time of the infection process over starting graphs on vertices. Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture.
The conjecture concerns the outstanding determination of the asymptotic maximum running time for the process. The paper notes that the conjectured upper bound was proved by Balogh et al. using a construction based on Behrend sets.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.