Semi-inducibility conjecture for symmetric paths
Statement
Let be a path of length whose first edges are red and whose remaining edges are blue. Let be the graph formed by a clique on vertices together with isolated vertices, and let denote the maximum asymptotic density of this colored path in a red/blue clique of red density . Semi-inducibility conjecture. For , is asymptotically achieved by or its complement. The case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.