Coastal construction of cubic maps without burying small faces


Try it here: https://stefanutti.vercel.app and then select waterworld-colonization πŸ™‚

It all started with this drawing, an idea and an algorithm.

How to build a large maps without small faces.

And with the help of AI and computers, the very enemies I am trying to defeat here :-), see the creation of maps without F2, F3, or F4.

Watch a planar map grow, live, on a sphere, visualizing the combinatorics behind the Four Color Theorem.

This is an interactive visualization of a growing cubic planar map, rendered on a fixed-size sphere (“Waterworld colonization”). It starts from the simplest possible thing: a single face floating in an empty ocean, no vertices, not yet a graph at all. The first move already sets the pattern for every move after it: a new border is drawn across the current coastline, adding one region, like a coastline advancing across the ocean.

Each new region follows simple combinatorial rules:

  • A sealing rule guarantees no region with fewer than 5 sides ever gets fully enclosed (“buried”) by its neighbors, a key structural invariant used in Four Color Theorem style reduction arguments.
  • The running quantity Ξ£(6βˆ’n) * Fβ‚™ βˆ’ C = 6 is tracked live in the “Ship’s log” panel and stays mathematically invariant at every single step, no matter how the coastline grows, a live visual proof of this invariant.

The camera is fully interactive: drag to orbit the globe, scroll or pinch to zoom, and use the Start/Stop and speed controls to watch the island grow at your own pace. Growth halts automatically once the island has expanded to fill the sphere.

PS: Once again, I came across many incredible stories of people chasing their dreams.

Let’s go to the beach: pentagonal regions and the Four Color Theorem


I need relax. Let’s go to the beach!

Personal note: I don’t know where I am headed, so don’t follow me. I am just wandering around taking notes.

Suppose that there exist maps that are not four-colorable, perhaps only one, perhaps a few, or even infinitely many.

Now, remove from this set all maps that have regions with 2, 3, or 4 borders. For the scope of the four color theorem and without lack of generality, we can skip them. 🀞🏻 I am confident it is true, but not completely sure I can do this step of removing these maps with no further considerations. Or at least it should be proved.

Now select a pentagonal region and regard it as the outer boundary: the ocean that surrounds all other lands.

And now walk along the shoreline.

What can we say about the five regions that face the ocean?

Can one of them be always an F5?

The answer is no, not always. Fullerene graphs show that it is possible for all F5 faces to be isolated, with no two pentagons sharing an edge. The standard example is the Buckminsterfullerene. Or, more commonly a soccer ball.

C60

Can one of them be always an F6?

Euler’s formula neither guarantees nor rules out this possibility.

1 F5 – 0 F6 – 1 F7 – 2 F8 – 3 F9 – … = 12

πŸ‘‰ I don’t know if there are studies done to analyze these maps. F5 always surrounded by F7 or higher.

To be continued …

  • Remove an edge between F5-F5, or F5-F6 or 😦 F5-F7+
  • Analyze all combinations of colors along the new shoreline of the reduced maps, and search for a contradiction to the hypothesis that there exist maps that cannot be colored with four colors

C6000 Fullerene: a playground for the Four Color Theorem coloring algorithm


On this great website https://networks.skewed.de/net/fullerene_structures, you can view and download fullerene structures in various formats.

Fullerenes are a perfect playground to test my four color algorithm.

I used the C6000 fullerene. 6000 atoms! A fullerene is an allotrope of carbon. Its molecules consist of carbon atoms connected by single and double bonds. A perfect 3-regular planar graphs ready to be tested.

And this is the four colored version you can play with, created using:

# python3 4ct.py -p planar_inputs/C6000.planar -c 2354 -o C6000

Actually, it is the Tait edge three colored version of the graph. This is equivalent to the four colored version of the faces.

This zip file includes the C6000.dot + C6000.edgelist files.

.

See you around!