Other Open Access
New Ramsey Multiplicity Bounds
Parczyk, Olaf; Pokutta, Sebastian; Spiegel, Christoph; Szabó, Tibor
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.
| Name | Size | |
|---|---|---|
|
certificates.zip
md5:367b90daeb4b7f5f530176bcb280f359 |
247.3 MB | Download |
|
graph6_description.txt
md5:45d08073c51907304d4d3ac9e5596938 |
6.7 kB | Download |
|
graphs.zip
md5:587c961bd729d6c164e58b96d7bce574 |
29.5 kB | Download |
| All versions | This version | |
|---|---|---|
| Views | 126 | 51 |
| Downloads | 17 | 17 |
| Data volume | 989.6 MB | 989.6 MB |
| Unique views | 98 | 43 |
| Unique downloads | 12 | 12 |
- Publication date:
- March 17, 2022
- DOI:
-
- License (for files):
- Creative Commons Attribution 4.0 International