Pages that link to "Item:Q1864134"
From MaRDI portal
The following pages link to Finding sets of points without empty convex 6-gons (Q1864134):
Displaying 25 items.
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Two disjoint 5-holes in point sets (Q827302) (← links)
- On the minimum number of mutually disjoint holes in planar point sets (Q904107) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Cells in any simple polygon formed by a planar point set (Q942099) (← links)
- Large convex holes in random point sets (Q1947987) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- On empty convex polygons in a planar point set (Q2368650) (← links)
- On the Erdös-Szekeres problem (Q2377533) (← links)
- Interior points in the Erdős-Szekeres theorems (Q2435979) (← links)
- Almost empty hexagons (Q2453368) (← links)
- Empty convex hexagons in planar point sets (Q2482196) (← links)
- On the Erdős-Szekeres \(n\)-interior-point problem (Q2509739) (← links)
- On the existence of a convex point subset containing one triangle in the plane (Q2581413) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- On Erdős-Szekeres-type problems (Q2851501) (← links)
- On the Erdős–Szekeres problem in combinatorial geometry (Q3503469) (← links)
- Specified holes with pairwise disjoint interiors in planar point sets (Q5154553) (← links)
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets (Q5302743) (← links)
- (Q6179339) (← links)
- Convex hulls of random order types (Q6567268) (← links)
- A SAT attack on higher dimensional Erdős-Szekeres numbers (Q6604680) (← links)
- On disjoint holes in point sets (Q6621264) (← links)
