The following pages link to The empty hexagon theorem (Q2464368):
Displaying 46 items.
- Almost empty monochromatic triangles in planar point sets (Q299089) (← links)
- Monochromatic empty triangles in two-colored point sets (Q385155) (← links)
- On pseudo-convex partitions of a planar point set (Q389454) (← links)
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 (Q461340) (← links)
- On balanced 4-holes in bichromatic point sets (Q482334) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Almost empty monochromatic quadrilaterals in planar point sets (Q722152) (← links)
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes (Q745644) (← links)
- Erdős-Szekeres theorem for lines (Q745670) (← links)
- Two disjoint 5-holes in point sets (Q827302) (← links)
- Empty monochromatic triangles (Q833720) (← 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)
- Drawing the Horton set in an integer grid of minimum size (Q1616238) (← links)
- Point sets with small integer coordinates and no large convex polygons (Q1704901) (← links)
- Large convex holes in random point sets (Q1947987) (← links)
- Empty rainbow triangles in \(k\)-colored point sets (Q1984595) (← links)
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\) (Q1984613) (← links)
- A note on the value in the disjoint convex partition problem (Q1991778) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Disjoint empty convex pentagons in planar point sets (Q2250824) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- A note on the upper bound for disjoint convex partitions (Q2342363) (← links)
- Empty triangles in good drawings of the complete graph (Q2345507) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Lower bounds for the number of small convex \(k\)-holes (Q2444312) (← links)
- 4-holes in point sets (Q2450200) (← links)
- Almost empty hexagons (Q2453368) (← links)
- On the Erdős-Szekeres \(n\)-interior-point problem (Q2509739) (← links)
- On the number of edges in geometric graphs without empty triangles (Q2637713) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- (Q4464707) (← links)
- On 5-Gons and 5-Holes (Q4899260) (← links)
- Specified holes with pairwise disjoint interiors in planar point sets (Q5154553) (← links)
- On convex holes in <i>d</i>-dimensional point sets (Q5886309) (← links)
- Holes in 2-convex point sets (Q5915543) (← links)
- On Erdős-Szekeres-type problems for \(k\)-convex point sets (Q5918941) (← links)
- Holes and islands in random point sets (Q6074686) (← links)
- Tight bounds on the expected number of holes in random point sets (Q6077049) (← links)
- Fixing a hole (Q6142356) (← links)
- (Q6179339) (← links)
