ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A two-rooted graph (H,s,t)(H,s,t) is a graph HH with two distinguished vertices ss and tt. A two-rooted graph is inherent if every graph containing a copy of HH also contains an avoidable copy of (H,s,t)(H,s,t). Let

P=(s,t,v)P=(s,t,v)

be a two-edge path.

Two-edge rooted-path conjecture. The two-rooted path (P,s,t)(P,s,t) 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 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.