ProbXiv
Explorersign in
Problem archiveProblem record

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 33, then the graph is cc-colorable, perhaps with c=4c=4.

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 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.