Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Geometric and Visual Perspective on the Four Color Map Theorem and K5 Non-Planarity and Their Connection

Version 1 : Received: 16 January 2024 / Approved: 17 January 2024 / Online: 17 January 2024 (04:25:38 CET)

How to cite: Shukla, C.K. A Geometric and Visual Perspective on the Four Color Map Theorem and K5 Non-Planarity and Their Connection. Preprints 2024, 2024011269. https://doi.org/10.20944/preprints202401.1269.v1 Shukla, C.K. A Geometric and Visual Perspective on the Four Color Map Theorem and K5 Non-Planarity and Their Connection. Preprints 2024, 2024011269. https://doi.org/10.20944/preprints202401.1269.v1

Abstract

This paper offers a novel geometric and visual approach to the renowned Four Color Map Theorem and K5 non-planarity problem while unveiling their profound connection to the "kissing number" problem in 2D. We represent planar graphs through circles and tangents, simplifying complex structures and shedding light on these classic problems. Our proofs by contradiction, rooted in the kissing number concept, reveal that both the Four Color Map Theorem and K5 non-planarity are fundamentally linked, as they pivot around the concept of coloring. This study bridges the realms of geometry and graph theory, providing fresh insights and emphasizing the significance of the kissing number problem in various fields.

Keywords

Geometry; Graph Theory; Four Color Map Theorem; K5 Non-Planarity; Kissing Number Problem; Planar Graphs; Visual Representation; Contradiction Proofs; Coloring; Mathematical Connections

Subject

Computer Science and Mathematics, Discrete Mathematics and Combinatorics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.