A non-constructive proof of the Four Colour Theorem

2022/12/19 by D. M. Jackson, L. B. Richmond, Jackson, D. M. +1 · 1 voice
Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Mathematics and Applications #math.CO

paper · pdf · doi:10.48550/arxiv.2212.09835

openalex publication_date 2022/12/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The approach is through a singularity analysis of generating functions for 3- and 4-connected triangulations, asymptotic analysis, properties of the ₃F₂ hypergeometric series, and Tutte's enumerative work on planar maps and chromatic polynomials.

Discussions

• A non-constructive proof of the Four Colour Theorem [hn, 173 points, 118 comments]

Related

• A manual proof of the Four-colour Theorem
• A pictorial proof of the Four Colour Theorem
• A formal proof of the four color theorem
• Special Partial Graphs
• Deciding 4-colorability of planar triangulations