Sciweavers

CADE
2006
Springer

Flyspeck I: Tame Graphs

14 years 5 months ago
Flyspeck I: Tame Graphs
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while reducing it from 5128 to 2771 graphs.
Tobias Nipkow, Gertrud Bauer, Paula Schultz
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2006
Where CADE
Authors Tobias Nipkow, Gertrud Bauer, Paula Schultz
Comments (0)