The bridgeless planar trivalent graph Tait polynomial positivity conjecture
Statement
Let be a connected planar trivalent graph, and let denote its Tait polynomial. Tait polynomial positivity conjecture. If is bridgeless, then has a perfect matching such that
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.