Code for Computing Tuple-chromatic Ramsey Numbers
Tuple-chromatic Ramsey numbers are based on a modification to definition of existing Ramsey numbers. Instead of requiring that the resultant set be monochrome, the new numbers allow the complete-graph subset to have a fixed number of colors less than the total number of edge colors of the original graph.
The code for this project can be found here: find_min_complete.zip.
Compile find_min_complete.cpp FColorGraph.cpp together with the include files.
Running the program requires several parameters. find_min_complete r q k trails stats_time stats_count space max_time
See the included README.txt for instructions.
Code for Computing Tuple-chromatic Van der Waerden Numbers
Tuple-chromatic Van der Waerden numbers are based on a modification to definition of Van der Waerden numbers. Instead of requiring that the resultant set be monochrome, the new numbers allow the arithmetic subsequence to have a fixed number of colors less than the total number of colors in the original sequence.
The code for this project can be found here: find_vdw.zip.
Compile find_vdw.cpp FVDW.cpp together with the include files.
Running the program requires several parameters. find_vdw array_size r q k debug
See the included readme_vdw for instructions.
Copyright (C) Reed Kelly, 2009
find_min_complete is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
find_min_complete is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with find_min_complete. If not, see http://www.gnu.org/licenses/