New Ramsey Multiplicity Bounds (Q740): Difference between revisions
From MaRDI portal
Created a new Item |
Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
Resource published at Zenodo repository | Resource published at Zenodo repository. | ||
| Property / 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 archivegraphs.zip. Lower bounds. We supply a certificate for all lower bounds stated in our paper in the archive graphs.zipthat can be verified using flagmatic. At the time of writing, a version of flagmaticcan be found at https://github.com/jsliacan/flagmatic. | |||
| Property / 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 archivegraphs.zip. Lower bounds. We supply a certificate for all lower bounds stated in our paper in the archive graphs.zipthat can be verified using flagmatic. At the time of writing, a version of flagmaticcan be found at https://github.com/jsliacan/flagmatic. / rank | |||
Normal rank | |||
Latest revision as of 09:15, 20 February 2025
Resource published at Zenodo repository.
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New Ramsey Multiplicity Bounds |
Resource published at Zenodo repository. |
Statements
17 March 2022
0 references
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 archivegraphs.zip. Lower bounds. We supply a certificate for all lower bounds stated in our paper in the archive graphs.zipthat can be verified using flagmatic. At the time of writing, a version of flagmaticcan be found at https://github.com/jsliacan/flagmatic.
0 references
