Flyspeck i: Tame graphs (2006)
by
Tobias Nipkow
,
Gertrud Bauer
,
Paula Schultz
| Venue: | International Joint Conference on Automated Reasoning, volume 4130 of LNCS |
| Citations: | 9 - 1 self |
BibTeX
@INPROCEEDINGS{Nipkow06flyspecki:,
author = {Tobias Nipkow and Gertrud Bauer and Paula Schultz},
title = {Flyspeck i: Tame graphs},
booktitle = {International Joint Conference on Automated Reasoning, volume 4130 of LNCS},
year = {2006},
pages = {21--35},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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. 1
Citations
| 585 | Isabelle/HOL: A Proof Assistant for Higher-Order Logic - Nipkow, Paulson, et al. - 2002 |
| 98 | Linear time algorithm for isomorphism of planar graphs - Hopcroft, Wong - 1974 |
| 78 | A proof of the Kepler conjecture - Hales - 2005 |
| 51 | A computer-checked proof of the Four Colour Theorem, unpublished - Gonthier |
| 41 | Executing higher order logic - Berghofer, Nipkow - 2000 |
| 18 | Cannonballs and honeycombs - Hales - 2000 |
| 6 | Proving Bounds for Real Linear Programs in Isabelle/HOL - Obua - 2005 |
| 3 | Formalizing Plane Graph Theory — Towards a Formalized Proof of the Kepler Conjecture - Bauer - 2006 |
| 2 | Sphere packings VI. tame graphs and linear programs - Hales |
| 2 | A proof of the dodecahedral conjecture, eprint: math.MG/9811079 - Hales, McLaughlin |
| 1 | A formalization of global optimization with Taylor models - Zumkeller - 2006 |
