wisha
Yeah, the four color problem becomes obvious to the brain if you try to place five territories on a plane (or a sphere) that are all adjacent to each other.
I think one of the earliest attempts at the 4 color problem proved exactly that (that C5 graph cannot be planar). Search engines are failing me in finding the source on this though.
But any way, that result is not sufficient to proof the 4-color theorem. A graph doesn’t need to have a C5 subgraph to make it impossible to 4-color. Think of two C4 graphs. Choose one vertex from each- call them A and B. Connect A and B together. Now make a new vertex called C and connect C to every vertex except A and B. The result should be a C5-free graph that cannot be 4-colored.
They will upstream stuff, but sadly they are not going to mainline.
I just downvoted your comment.
FAQ
What does this mean?
The amount of points on your comment will be decreased by one. The deduction will be federated across thousands of Lemmy instances, bringing you shame from across the Fediverse.
Why did you do this?
There are several reasons I may deem a comment to be unworthy of positive or neutral points. These include, but are not limited to:
- Rudeness towards other users,
- Spreading incorrect information,
- Sarcasm not correctly flagged with a /s.
As this is your first time receiving my downvote, I will provide reasons (listed below) to help you avoid making these mistakes again. Note that this will not be the case with future downvotes.
- Writing variables next to each other to form words. “Y o u” is not an English word. If you want the English word “You” in LaTeX math mode, write \text{You}.
- Your “rotation matrix” has determinant of -1, meaning it is not a rotation matrix. Propaganda promoting improper rotations will not be tolerated on mander.xyz.
Am I banned from the Lemmy?
No - not yet. But you should refrain from making comments like this in the future. Otherwise I will be forced to issue an additional downvote, which may put your commenting and posting privileges in jeopardy.
I don’t believe my comment deserved a downvote. Can you un-downvote it?
Sure, mistakes happen. But only in exceedingly rare circumstances will I undo a downvote. If you would like to issue an appeal, shoot me a private message explaining what I got wrong. I tend to respond to PMs within several minutes. Do note, however, that over 99.9% of downvote appeals are rejected, and yours is likely no exception.
How can I prevent this from happening in the future?
Accept the downvote and move on. But learn from this mistake: your behavior will not be tolerated on mander.xyz or the Fediverse as a whole. I will continue to issue downvotes until you improve your conduct. Remember: Posting is privilege, not a right.
Were you modding an existing power supply or making one from scratch?
No love for GNU IceCat?
It might sound trivial but it is not! Imagine there is a lever at every point on the real number line; easy enough right? you might pick the lever at 0 as your “first” lever. Now imagine in another cluster I remove all the integer levers. You might say, pick the lever at 0.5. Now I remove all rational levers. You say, pick sqrt(2). Now I remove all algebraic numbers. On and on…
If we keep playing this game, can you keep coming up with which lever to pick indefinitely (as long as I haven’t removed all the levers)? If you think you can, that means you believe in the Axiom of Countable Choice.
Believing the axiom of countable choice is still not sufficient for this meme. Because now there are uncountably many clusters, meaning we can’t simply play the pick-a-lever game step-by-step; you have to pick levers continuously at every instant in time.
According to the Librem people: this is Android kernel (& other low level stuff) with Debian userspace, not a true Debian phone. https://social.librem.one/@dos/112686932765355105
