Pith. sign in

REVIEW

Reducibility in the Four-Color Theorem

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1401.6481 v1 pith:UKU6KCD7 submitted 2014-01-25 math.CO cs.DM

Neil Robertson , Daniel P. Sanders , Paul Seymour , Robin Thomas This is my paper · ORCID
classification math.COcs.DM
keywords computerfour-colorgivelemmasprooftheoremthoseaccompanying
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have verified those statements using a computer. Here we give additional details for one of those lemmas, and we include the original computer programs and data as "ancillary files" accompanying this submission.

Discussion (0). Continue with ORCID to comment.

Pith tools