The two-edge rooted-path inherence conjecture
Statement
A two-rooted graph is a graph with two distinguished vertices and . A two-rooted graph is inherent if every graph containing a copy of also contains an avoidable copy of . Let
be a two-edge path.
Two-edge rooted-path conjecture. The two-rooted path is inherent.
This is presented as the first nontrivial step toward understanding inherent graphs, following results that characterize necessary conditions for connected inherent two-rooted graphs and establish that all endpoints-rooted paths are inherent. Its resolution is not given in the 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.