Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points |
scientific article; zbMATH DE number 7038739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points |
scientific article; zbMATH DE number 7038739 |
Statements
Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (English)
0 references
20 March 2019
0 references
Erdős-Szekeres conjecture
0 references
happy ending problem
0 references
convex polygons
0 references
interactive theorem proving
0 references
SAT-solving
0 references
Isabelle/HOL
0 references
0 references
0.8799647
0 references
0.8776039
0 references
0.87004477
0 references
0.8642348
0 references
0.8642348
0 references
0.85819495
0 references
