Published March 17, 2022
| Version v4
Other
Open
New Ramsey Multiplicity Bounds
- 1. Freie Universität Berlin, Institute of Mathematics, Berlin
- 2. Technische Universität Berlin, Institute of Mathematics, Berlin and Zuse Institute Berlin, Department for AI in Society, Science, and Technology, Germany
- 3. Zuse Institute Berlin, Department for AI in Society, Science, and Technology, Germany
Description
These are the supplementary files for the paper “New Ramsey Multiplicity Bounds and Search Heuristics” by Parczyk, Pokutta, Spiegel, and Szabo.
Upper bounds. All graphs are described through their graph6 string. A full description of how to derive this description is included in the file graph6_description.txt. All small constructions are stated in the paper and the larger constructions are contained in the archive graphs.zip.
Lower bounds. We supply a certificate for all lower bounds stated in our paper in the archive graphs.zip that can be verified using flagmatic. At the time of writing, a version of flagmatic can be found at https://github.com/jsliacan/flagmatic.
Files
certificates.zip
Additional details
Related works
- Is part of
- EF1-12 (Other)
- Is supplement to
- arXiv:2206.04036 (arXiv)