Path P_6 edge-inducibility conjecture
Statement
Let be the path on six vertices. The paper establishes the bounds
Path edge-inducibility conjecture. The lower bound is exact:
The conjecture concerns one of the paper's remaining unsettled small-graph cases and asserts optimality of the known construction; the source gives no resolution.
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.