ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar trivalent graph, and let TGT_G denote its Tait polynomial. Tait polynomial four-colorability conjecture. The graph GG is 44-colorable if and only if

TG(1)>0.T_G(1)>0.

The source presents this as conditional on positivity properties of the 22-factor polynomial and gives no resolution independent of those results.

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.