Coloring count cones of planar graphs

Zdeněk Dvořák, Bernard Lidický

This page contains computer assisted parts of the paper Coloring count cones of planar graphs.

A preliminary version of the paper can be downloaded here or from arXiv.

Here, you can download the technical things as one archive

• anc.zip (around 14KB)
• proof.tar.bz2 (around 9.9GB, 48GB after decompression)
• 4cone-minors.pdf List of 38 minors and their description

Dependencies

• Some C++ compiler
• Sage Math

Description of the content of anc.zip

• proof_verification.cpp ... C++ program that verifies the proof (proof.tar.bz2) of Lemma 12.
• rays_test.sage ... Sage program that generates rays for Lemma 6.