2022/03/17 by Olaf Parczyk, Parczyk, Olaf, Sebastian Pokutta +5
Computer Science · Mathematics · #05D10 #90C27 #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2206.04036
openalex publication_date 2022/03/17 · openalex created_date 2022/06/13 · openalex updated_date 2026/07/28
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 graph6description.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.