ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected planar trivalent graph, and let TG(z)T_G(z) denote its Tait polynomial. Tait polynomial positivity conjecture. If GG is bridgeless, then GG has a perfect matching MM such that

⟨G:M⟩2(1)>0.\langle G:M\rangle_2(1)>0.

The source explains that this is equivalent to the four color theorem, which was proved with the aid of a computer in the 1970s; it is therefore solved.

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.