ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a strictly 22-balanced graph, and let d2(H)d_2(H) denote its 22-density. Let FF be a fixed non-empty graph satisfying

m(F)>d2(H).m(F)>d_2(H).

Dense fixed-subgraph conjecture. With high probability, the final graph of the HH-free process contains no copy of FF. This strengthens the proved result for graphs whose number of vertices may grow moderately with nn, and is motivated by the fact that the known bound for the maximum density of fixed graphs appearing in the process is best possible up to constants. The statement is presented as a belief in the source, and no resolution is supplied here.

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.