Conjecture that the exact induced density formula holds for all graph sizes
Statement
Let be a strongly asymmetric graph on vertices. Let be the maximum number of induced copies of in an -vertex graph, and let be the recursively defined nested-blowup count. Exact density conjecture. For every ,
Consequently, the inducibility of satisfies
The preceding theorem establishes the formula only in the range covered there; this conjecture proposes its extension to all for strongly asymmetric graphs.
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.