ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PEℓNℓP_{E^\ell N^\ell} be a path of length 2ℓ2\ell whose first ℓ\ell edges are red and whose remaining ℓ\ell edges are blue. Let K(a,n)K(a,n) be the graph formed by a clique on aa vertices together with n−an-a isolated vertices, and let I(PEℓNℓ,β)I(P_{E^\ell N^\ell},\beta) denote the maximum asymptotic density of this colored path in a red/blue clique of red density β\beta. Semi-inducibility conjecture. For ℓ≥2\ell \geq 2, I(PEℓNℓ,β)I(P_{E^\ell N^\ell},\beta) is asymptotically achieved by K(a,n)K(a,n) or its complement. The case ℓ=2\ell=2 is established by the theorem preceding this conjecture, while the claim for longer symmetric paths is motivated by flag-algebra experiments and 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.