Pages that link to "Item:Q3541568"
From MaRDI portal
The following pages link to Computer solution to the 17-point Erdős-Szekeres problem (Q3541568):
Displaying 42 items.
- Almost empty monochromatic triangles in planar point sets (Q299089) (← links)
- Erdős-Szekeres without induction (Q309659) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Computer solution of the almost empty hexagon problem (Q650447) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- Almost empty monochromatic quadrilaterals in planar point sets (Q722152) (← links)
- Around Erdős-Szekeres problems (Q736016) (← links)
- Erdős-Szekeres theorem for lines (Q745670) (← links)
- Two disjoint 5-holes in point sets (Q827302) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- On the minimum number of mutually disjoint holes in planar point sets (Q904107) (← links)
- Two upper bounds for the Erdős-Szekeres number with conditions (Q1943650) (← links)
- The Erdős-Szekeres theorem and congruences (Q1957086) (← links)
- A note on the value in the disjoint convex partition problem (Q1991778) (← links)
- On the existence of a point subset with 3 or 6 interior points (Q2014748) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- Faradžev Read-type enumeration of non-isomorphic CC systems (Q2230397) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- A note on the upper bound for disjoint convex partitions (Q2342363) (← links)
- Interior points in the Erdős-Szekeres theorems (Q2435979) (← links)
- Almost empty hexagons (Q2453368) (← links)
- On the Erdős-Szekeres \(n\)-interior-point problem (Q2509739) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Regular systems of paths and families of convex sets in convex position (Q2790591) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- On Erdős-Szekeres-type problems (Q2851501) (← links)
- The Erdős-Szekeres problem for non-crossing convex sets (Q2874619) (← links)
- Specified holes with pairwise disjoint interiors in planar point sets (Q5154553) (← links)
- THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION (Q5376526) (← links)
- A SAT attack on the Erdős-Szekeres conjecture (Q5890914) (← links)
- A SAT attack on the Erdős-Szekeres conjecture (Q5920081) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- (Q6179339) (← links)
- A SAT attack on higher dimensional Erdős-Szekeres numbers (Q6604680) (← links)
- The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\) (Q6614724) (← links)
- On disjoint holes in point sets (Q6621264) (← links)
- Erdős-Szekeres-type problems in the real projective plane (Q6642299) (← links)
- Automated mathematical discovery and verification: minimizing pentagons in the plane (Q6648153) (← links)
- On the Erdős-Tuza-Valtr conjecture (Q6655707) (← links)
