Results 1 -
2 of
2
A proof of the Kepler conjecture
- Math. Intelligencer
, 1994
"... This section describes the structure of the proof of ..."
Abstract
-
Cited by 78 (12 self)
- Add to MetaCart
This section describes the structure of the proof of
Flyspeck i: Tame graphs
- International Joint Conference on Automated Reasoning, volume 4130 of LNCS
, 2006
"... 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 ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
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

