The following pages link to (Q4849067):
Displaying 10 items.
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 (Q748891) (← links)
- Point sets with small integer coordinates and no large convex polygons (Q1704901) (← links)
- The maximum number of unit distances in a convex \(n\)-gon (Q1813293) (← links)
- Two upper bounds for the Erdős-Szekeres number with conditions (Q1943650) (← links)
- Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles (Q2021406) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- On the decay of the smallest singular value of submatrices of rectangular matrices (Q3181168) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\) (Q5937134) (← links)
- The never-ending happiness of Paul Erdős's mathematics (Q6638646) (← links)
