ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a finite graph HH, let ind⁡(H)\operatorname{ind}(H) denote its inducibility, and let K∣H∣K_{|H|} and K‾∣H∣\overline{K}_{|H|} be respectively the complete and edgeless graphs on ∣H∣|H| vertices. The Large Inducibility Conjecture.

lim sup⁡{ind⁡(H):H∉{K∣H∣,K‾∣H∣}}=1/e.\limsup \left\{\operatorname{ind}(H): H \notin \{K_{|H|}, \overline{K}_{|H|}\} \right\} = 1/e.

The conjecture is presented as an analogue for graph inducibilities of the Edge-statistics Conjecture and would be implied by it. The known lower bounds include nontrivial graphs with inducibility approaching 1/e1/e, while the matching universal upper bound 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.