🧵 Untitled Thread
Anonymous at Sat, 4 May 2024 14:30:47 UTC No. 16159032
The Four Color Theorem states that any map on a plane such as pic related can be colored in 4 colors or less without adjacent regions having the same color.
First proposed in 1852, it has only ever been proven by determining all unique patterns that a map could be composed of and checking all colorations of those patterns using a computer.
Why is this theorem so hard to prove mathematically/elegantly?
Anonymous at Sat, 4 May 2024 15:26:07 UTC No. 16159162
>>16159032
Who gives a fuck. Why is this shit a thing in the first place? When am I supposed to need it, when I want to color a shit map without good information?
Anonymous at Sat, 4 May 2024 15:35:30 UTC No. 16159181
>>16159032
Is that a stained glass window from a chapel church? They need to elongate the cross.
Anonymous at Sat, 4 May 2024 15:37:52 UTC No. 16159183
>>16159032
>>16159181
This is how you do that right.
Anonymous at Sat, 4 May 2024 17:36:03 UTC No. 16159342
>>16159162
it's helpful for graph theory i think
Anonymous at Sat, 4 May 2024 17:45:20 UTC No. 16159353
>>16159032
>Why is this theorem so hard to prove mathematically/elegantly?
Combinatorics is notoriously ugly. It's discrete, there are no symmetries involved, all you can do is enumerate the possible configurations.
Anonymous at Sat, 4 May 2024 22:43:02 UTC No. 16159774
>>16159032
>Why is this theorem so hard to prove mathematically/elegantly?
It's not. In all likelihood, there exists a 1-2 page proof of the theorem, we just haven't found it yet.
Protip: humans are very bad at finding simple proofs.
Anonymous at Sun, 5 May 2024 13:37:16 UTC No. 16160646
>>16159183
This one doesn't even have a cross.