ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a strongly asymmetric graph on hh vertices. Let iH(n)i_H(n) be the maximum number of induced copies of HH in an nn-vertex graph, and let g(n,h)g(n,h) be the recursively defined nested-blowup count. Exact density conjecture. For every n∈Nn\in\mathbb{N},

iH(n)=g(n,h).i_H(n)=g(n,h).

Consequently, the inducibility of HH satisfies

iH=h!hh−h.i_H=\frac{h!}{h^h-h}.

The preceding theorem establishes the formula only in the range covered there; this conjecture proposes its extension to all nn 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 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.