For the theorem above, a known lower bound is Ωpn log nq, and this result addresses a question of Keevash, Mubayi, Sudakov, and Ver- straete [1].
Statement
For the theorem above, a known lower bound is Ωpn log nq, and this result addresses a question of Keevash, Mubayi, Sudakov, and Ver- straete [1]. The report passage is retained verbatim as the relevant context for this extracted problem.
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.