The following pages link to A point in many triangles (Q2500999):
Displayed 12 items.
- A new lower bound based on Gromov's method of selecting heavily covered points (Q452003) (← links)
- A slight improvement to the colored Bárány's theorem (Q490250) (← links)
- Positive-fraction intersection results and variations of weak epsilon-nets (Q527009) (← links)
- Hitting simplices with points in \(\mathbb R^{3}\) (Q603863) (← links)
- Stabbing simplices by points and flats (Q848667) (← links)
- Extremal problems for pairs of triangles (Q2131860) (← links)
- Intersection theorems for triangles (Q2172651) (← links)
- Expander graphs -- both local and global (Q2226628) (← links)
- Hypergraph expanders from Cayley graphs (Q2327965) (← links)
- Selection Lemmas for Various Geometric Objects (Q2828788) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- Improved bounds for discrete Voronoi games (Q6179421) (← links)