ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a directed cycle C⃗k\vec{C}_k, call a directed graph a fractalizer if its extremal induced-copy density is attained by iterated balanced blow-ups of C⃗k\vec{C}_k. Directed-cycle fractalizer conjecture. For all k≥4k\geq 4, C⃗k\vec{C}_k is a fractalizer. The paper proves that C⃗5\vec{C}_5 is a fractalizer and reports that related unpublished work establishes the corresponding property for C⃗4\vec{C}_4 in a weaker stated form; the assertion for every k≥4k\geq4 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 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.