## Maximal triangle-free graphs and Ramsey graphs |

## Home## AuthorsGunnar Brinkmann Jan-Christoph Schlage-Puchta |
## Maximal triangle-free graphs and Ramsey graphs
The algorithms used in the generator are described in: -
G. Brinkmann, J. Goedgebeur and J.C. Schlage-Puchta,
*Ramsey numbers R(K3,G) for graphs of order 10*, Electronic Journal of Combinatorics, 19(4), 2012.
The generator can be
- Download, extract and configure nauty (triangleramsey requires nauty 2.5 or a more recent version).
- Copy the following files to the triangleramsey directory: naugraph.c nautil.c nauty.c nauty.h naurng.c naurng.h schreier.c schreier.h sorttemplates.c
- Compile using the command "make".
The number of maximal triangle-free graphs can be found at the House of Graphs and various Ramsey graphs can be downloaded here. Don't hesitate to contact us at jan.goedgebeur[at]ugent.be if you have any further questions or suggestions. |