Computer solution to the 17-point Erdős-Szekeres problem
From MaRDI portal
Publication:3541568
DOI10.1017/S144618110000300XzbMath1152.52008OpenAlexW2164902489WikidataQ54152677 ScholiaQ54152677MaRDI QIDQ3541568
George Szekeres, Lindsay Peters
Publication date: 26 November 2008
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s144618110000300x
Related Items (35)
Two disjoint 5-holes in point sets ⋮ Almost empty monochromatic triangles in planar point sets ⋮ Erdős-Szekeres without induction ⋮ Square Coloring Planar Graphs with Automatic Discharging ⋮ On \(k\)-gons and \(k\)-holes in point sets ⋮ Two upper bounds for the Erdős-Szekeres number with conditions ⋮ On the minimum number of mutually disjoint holes in planar point sets ⋮ Interior points in the Erdős-Szekeres theorems ⋮ Empty squares in arbitrary orientation among points ⋮ The Erdős-Szekeres theorem and congruences ⋮ THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION ⋮ A SAT attack on the Erdős-Szekeres conjecture ⋮ Computer solution of the almost empty hexagon problem ⋮ Unnamed Item ⋮ Almost empty hexagons ⋮ Faradžev Read-type enumeration of non-isomorphic CC systems ⋮ Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points ⋮ Specified holes with pairwise disjoint interiors in planar point sets ⋮ A SAT attack on the Erdős-Szekeres conjecture ⋮ A note on the value in the disjoint convex partition problem ⋮ Binary pattern tile set synthesis is NP-hard ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ On the existence of a point subset with 3 or 6 interior points ⋮ Regular systems of paths and families of convex sets in convex position ⋮ Almost empty monochromatic quadrilaterals in planar point sets ⋮ On the Erdős-Szekeres \(n\)-interior-point problem ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ Around Erdős-Szekeres problems ⋮ Erdős-Szekeres theorem for lines ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\) ⋮ Faster counting empty convex polygons in a planar point set ⋮ The Erdős-Szekeres Problem ⋮ On Erdős-Szekeres-type problems ⋮ A note on the upper bound for disjoint convex partitions ⋮ THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS
Cites Work
This page was built for publication: Computer solution to the 17-point Erdős-Szekeres problem
