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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bauer, G.: Formalizing Plane Graph Theory — Towards a Formalized Proof of the Kepler Conjecture. PhD thesis, Technische Universität München (2006)
Berghofer, S., Nipkow, T.: Executing higher order logic. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 24–40. Springer, Heidelberg (2002)
Gonthier, G.: A computer-checked proof of the four colour theorem, available at research.microsoft.com/~gonthier/4colproof.pdf
Hales, T.C.: Cannonballs and honeycombs. Notices Amer. Math. Soc. 47, 440–449 (2000)
Hales, T.C.: A proof of the Kepler conjecture. Annals of Mathematics 162, 1063–1183 (2005)
Hales, T.C.: Sphere packings, VI. Tame graphs and linear programs. Discrete and Computational Geometry (to appear, 2006)
Hales, T.C., McLaughlin, S.: A proof of the dodecahedral conjecture, E-print archive arXiv.org/abs/math.MG/9811079
Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs (preliminary report). In: STOC 1974: Proc. 6th ACM Symposium Theory of Computing, pp. 172–184. ACM Press, New York (1974)
Nipkow, T., Paulson, L., Wenzel, M.: Isabelle/HOL — A Proof Assistant for Higher-Order Logic. In: Nipkow, T., Paulson, L.C., Wenzel, M.T. (eds.) Isabelle/HOL. LNCS, vol. 2283, Springer, Heidelberg (2002), http://www.in.tum.de/~nipkow/LNCS2283/
S. Obua. Proving bounds for real linear programs in Isabelle/HOL. In J. Hurd, editor, Theorem Proving in Higher Order Logics (TPHOLs 2005), volume 3603 of Lect. Notes in Comp. Sci., pages 227–244. Springer-Verlag, 2005.
Zumkeller, R.: A formalization of global optimization with Taylor models. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nipkow, T., Bauer, G., Schultz, P. (2006). Flyspeck I: Tame Graphs. In: Furbach, U., Shankar, N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science(), vol 4130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814771_4
Download citation
DOI: https://doi.org/10.1007/11814771_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37187-8
Online ISBN: 978-3-540-37188-5
eBook Packages: Computer ScienceComputer Science (R0)