The following pages link to On empty convex polytopes (Q1346996):
Displaying 15 items.
- Constructions from empty polygons (Q558322) (← links)
- An Erdős-Ko-Rado theorem for the subcubes of a cube (Q762158) (← links)
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets (Q1201240) (← links)
- Lower bounds for the numbers of antipodal pairs and strictly antipodal pairs of vertices in a convex polytope (Q1317875) (← links)
- Some Erdős-Szekeres type results about points in space (Q1335532) (← links)
- Point configurations in \(d\)-space without large subsets in convex position (Q1423586) (← links)
- On the empty convex partition of a finite set in the plane. (Q1861024) (← links)
- A sufficient condition for the existence of large empty convex polygons (Q1864123) (← links)
- On convex polytopes in \(\mathbb R^{d}\) containing and avoiding zero (Q1940364) (← links)
- Empty monochromatic simplices (Q2250050) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem (Q5929326) (← links)
- (Q6179339) (← links)
- A SAT attack on higher dimensional Erdős-Szekeres numbers (Q6604680) (← links)
