Dense fixed-subgraph conjecture for the final H-free process
Statement
Let be a strictly -balanced graph, and let denote its -density. Let be a fixed non-empty graph satisfying
Dense fixed-subgraph conjecture. With high probability, the final graph of the -free process contains no copy of . This strengthens the proved result for graphs whose number of vertices may grow moderately with , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.