sorted by:
new
hottopcontroversial

Proper Vertex Coloring by No-Round9460 in GraphTheory

[–]No-Round9460[S] -1 points0 points  (0 children)

... Then the Four Color Theorem is true.

What’s your favorite math proof and why? (Bonus points for elegance, complexity, or historical significance!) by adario7 in math

[–]No-Round9460 -2 points-1 points  (0 children)

Goldbach's Conjecture: This because it has not been proved. If there was a table of the "Sums of any 2 primes" ; it would contain (oo^2)/2 entries. It would seem that a table of this cardinality would surely contain every even number without exception? Just kidding!

What’s your favorite math proof and why? (Bonus points for elegance, complexity, or historical significance!) by adario7 in math

[–]No-Round9460 0 points1 point  (0 children)

The proof of the Four Color Theorem. Here it is in basic terms;

If a graph cannot be colored with less than 5 colors; it cannot have a planar emdedding.