The directed-cycle fractalizer conjecture
Statement
For a directed cycle , call a directed graph a fractalizer if its extremal induced-copy density is attained by iterated balanced blow-ups of . Directed-cycle fractalizer conjecture. For all , is a fractalizer. The paper proves that is a fractalizer and reports that related unpublished work establishes the corresponding property for in a weaker stated form; the assertion for every remains open.
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.