The path-spanning 3-colorability conjecture
Statement
For a graph, say that a path spans a subgraph if the vertices of the path are the vertex set of that subgraph.
Path-spanning 3-colorability conjecture. If each path of a graph spans a subgraph with chromatic number at most , then the graph is -colorable, perhaps with .
The claim is presented as an open warm-up for a broader question about bounding graph chromatic number from restrictions on subgraphs spanned by odd cycles. 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.