Flyspeck I: Tame graphs

Tobias Nipkow; Gertrud Bauer; Paula Schultz

doi:10.1007/11814771_4

Flyspeck I: Tame graphs

Tobias Nipkow, Gertrud Bauer, Paula Schultz

Default

Technical University of Munich

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

26 Scopus citations

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.

Original language	English
Title of host publication	Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings
Publisher	Springer Verlag
Pages	21-35
Number of pages	15
ISBN (Print)	3540371877, 9783540371878
DOIs	https://doi.org/10.1007/11814771_4
State	Published - 2006
Event	Third International Joint Conference on Automated Reasoning, IJCAR 2006 - Seattle, WA, United States Duration: 17 Aug 2006 → 20 Aug 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4130 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Third International Joint Conference on Automated Reasoning, IJCAR 2006
Country/Territory	United States
City	Seattle, WA
Period	17/08/06 → 20/08/06

Access to Document

10.1007/11814771_4

Cite this

Nipkow, T., Bauer, G., & Schultz, P. (2006). Flyspeck I: Tame graphs. In Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings (pp. 21-35). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4130 LNAI). Springer Verlag. https://doi.org/10.1007/11814771_4

@inproceedings{489eb72cde7a43feafa13da1bd5b089c,

title = "Flyspeck I: Tame graphs",

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.",

author = "Tobias Nipkow and Gertrud Bauer and Paula Schultz",

year = "2006",

doi = "10.1007/11814771_4",

language = "English",

isbn = "3540371877",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "21--35",

booktitle = "Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings",

note = "Third International Joint Conference on Automated Reasoning, IJCAR 2006 ; Conference date: 17-08-2006 Through 20-08-2006",

}

Nipkow, T, Bauer, G & Schultz, P 2006, Flyspeck I: Tame graphs. in Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4130 LNAI, Springer Verlag, pp. 21-35, Third International Joint Conference on Automated Reasoning, IJCAR 2006, Seattle, WA, United States, 17/08/06. https://doi.org/10.1007/11814771_4

Flyspeck I: Tame graphs. / Nipkow, Tobias; Bauer, Gertrud; Schultz, Paula.
Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings. Springer Verlag, 2006. p. 21-35 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4130 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Flyspeck I

T2 - Third International Joint Conference on Automated Reasoning, IJCAR 2006

AU - Nipkow, Tobias

AU - Bauer, Gertrud

AU - Schultz, Paula

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33749579435&partnerID=8YFLogxK

U2 - 10.1007/11814771_4

DO - 10.1007/11814771_4

M3 - Conference contribution

AN - SCOPUS:33749579435

SN - 3540371877

SN - 9783540371878

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 21

EP - 35

BT - Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings

PB - Springer Verlag

Y2 - 17 August 2006 through 20 August 2006

ER -

Flyspeck I: Tame graphs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this