@zwol Assume there was a counterexample triangulation T that cannot be 4-colored. Then all the triangulations that contain T cannot be 4-colored either. By Theorem A, almost all triangulations contain T. So, if a positive proportion of all triangulations can be 4-colored, that means it cannot be the case that there is even a single triangulation that cannot be 4-colored.
=> More informations about this toot | View the thread | More toots from VinceVatter@mathstodon.xyz
=> View zwol@hackers.town profile
text/gemini
This content has been proxied by September (ba2dc).