The avoidable induced path conjecture
Statement
Let be a graph, and let denote an induced path on vertices. An induced path is avoidable if every extension of is contained in an induced cycle, where an extension is an induced path obtained by adding one edge to at each end. Avoidable induced path conjecture. For every , every graph that contains an induced also contains an avoidable induced . This conjecture would simultaneously generalize the avoidable-vertex theorem and the result that graphs with no induced cycles of lengths at least contain a simplicial induced ; its status is not resolved in the supplied source.
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.