Prove Four-Color Conjecture With "Color Chain Combination Theory"

Authors

  • Zhang Yudian Associate Professor of Mathematics, ,Shanxi Yuxian County Party School 045100, China
  • Zhang Yiran Postgraduate, Shanxi Yuxian County Party School 045100, China https://orcid.org/0000-0002-6328-9695
  • Gong Yixuan Shanghai Oriental Fortune, Shanghai, China

DOI:

https://doi.org/10.33425/2690-8077.1129

Keywords:

Kempe configuration, Heawood configuration, H and Z staining program,, color chain combination theory

Abstract

In the second issue of xinzhou teachers university Journal in 2004, The Perfection of Kempe's Proof was published [1]. The key points are: using the different combination theory of six color chains and the periodic H-staining program, nine configurations were constructed, which answered the question of how many Heawood configurations Kempe missed, but the discussion was not complete and accurate. In this paper, not only the generation process and detailed solution process of nine configurations are given completely, but also the completeness of nine configurations is proved by reduction to absurdity, which is an important revision and supplement of literature 1. It is different from the published method of "4- staining of dilemma configuration of four-color conjecture", but the classification of the configuration is completely consistent with the conclusion of 4- staining which can be used as a companion for readers to taste.

Downloads

Published

2024-09-12

How to Cite

Zhang Yudian, Zhang Yiran, & Gong Yixuan. (2024). Prove Four-Color Conjecture With "Color Chain Combination Theory". Japan Journal of Research, 5(7). https://doi.org/10.33425/2690-8077.1129

Issue

Section

Articles