ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is planar if it can be embedded in the plane without crossings. A graph is 4-critical if its chromatic number is 4 and deleting any edge lowers its chromatic number. A graph is P7P_7-free if it has no induced subgraph isomorphic to the path P7P_7. Exhaustive classification conjecture. The 52 graphs from Table~ are the only planar 4-critical P7P_7-free graphs.

This conjecture concerns the unresolved general planar P7P_7-free case. The authors determined all planar 4-critical P7P_7-free graphs with at most 30 vertices, and the largest graph found in that range has 13 vertices; whether any further graphs exist remains open.

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.