The following pages link to (Q5628820):
Displayed 18 items.
- Almost empty monochromatic triangles in planar point sets (Q299089) (← links)
- Erdős-Szekeres without induction (Q309659) (← 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)
- 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)
- More on an Erdős-Szekeres-type problem for interior points (Q1042448) (← links)
- Nine convex sets determine a pentagon with convex sets as vertices (Q1123407) (← links)
- Some Erdős-Szekeres type results about points in space (Q1335532) (← links)
- On the existence of a point subset with 3 or 6 interior points (Q2014748) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- A note on the upper bound for disjoint convex partitions (Q2342363) (← links)
- Covering the convex quadrilaterals of point sets (Q2373933) (← links)
- More on planar point subsets with a specified number of interior points (Q2518026) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- Specified holes with pairwise disjoint interiors in planar point sets (Q5154553) (← links)
- (Q6179339) (← links)