ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let PkP_k denote an induced path on kk vertices. An induced path PP is avoidable if every extension of PP is contained in an induced cycle, where an extension is an induced path obtained by adding one edge to PP at each end. Avoidable induced path conjecture. For every k≥1k\ge 1, every graph that contains an induced PkP_k also contains an avoidable induced PkP_k. This conjecture would simultaneously generalize the avoidable-vertex theorem and the result that graphs with no induced cycles of lengths at least k+3k+3 contain a simplicial induced PkP_k; 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 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.