quasi
Posts:
12,067
Registered:
7/15/05


Re: A New Graph Coloring Conjecture.
Posted:
Jun 23, 2013 4:02 AM


bill wrote:
>The graph IS a complete K5 graph.
Are you claiming that K5 is not 4colorable?
If so, that's a triviality.
If not, what are you claiming?
Are you able to write a complete, precisely worded mathematical statement?
>What would you call a graph in which every vertex is adjacent >to every other vertex?
A complete graph.
quasi

