ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MK5(n)M_{K_5}(n) denote the maximum running time of the K5K_5 infection process over starting graphs on nn vertices. Bollobás–Przykucki–Riordan–Sahasrabudhe conjecture.

MK5(n)=o(n2).M_{K_5}(n)=o(n^2).

The conjecture concerns the outstanding determination of the asymptotic maximum running time for the K5K_5 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.