So after reading about maps, I was thinking and I came up with a formula to dictate the number of colors necessary to properly color a graph I tried it out on a few, and it seems to work, but I have no clue on how to go about proving it. So my claim is:

Question

So after reading about maps, I was thinking and I came up with a formula to dictate the number of colors necessary to properly color a graph  I tried it out on a few, and it seems to work, but I have no clue on how to go about proving it.  So my claim is:

fibonaccichick666 · Answer

@zepdrix

zepdrix · Answer

Hmm I don't know what a map is.
And what does this `no triangles` give us?
Every cycle contains an even number of edges or some business?

fibonaccichick666 · Answer

so, second off, a map is here described http://www.csun.edu/~danielk/teaching/graph-theory/notes02.pdf

zepdrix · Answer

bahh i need a math break >.<

fibonaccichick666 · Answer

haha, it's ok, I'm gonna delete this though.

fibonaccichick666 · Answer

don't want anyone stealing my theory that could get me a phd without all the effort

fibonaccichick666 · Answer

...if it works that is lol