Ramsey(3,3,3)>16

Color the edges (the complete graph on vertices) with three colors, red, green, and blue. When the Ramsey number , the graph will contain either a red , a green , or a blue , and any smaller complete graph can be colored to avoid such subgraphs.
The Ramsey number is known to be 17, so cannot be 3-colored without a monochromatic triangle.
This Demonstration shows that can be 3-colored to be triangle free, proving that . Every pair of circles is connected in exactly one of the three Clebsch graphs, which together form . Move the slider to permute the vertices.

(11 lines omitted)
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+