Work

A New Proof of the Four Color Theorem

Year: 2026

Type: preprint

Abstract: The Four Color Theorem states that every finite map on the sphere can be colored with at most four colors so that any two adjacent regions receive different colors. In this paper, we study the theorem from a topological and graph-theoretic point of view and introduce a strengthened boundary coloring property for disk triangulations. By applying the inductive hypothesis, this property is preserved. This provides an inductive framework for proving the Four Color Theorem without using a computer and exhaustion.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.22343830

Author: Huang, Zhenxi

Institution: Jinan University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7208813232

Cites:

Cited by:

Related to: