Pages that link to "Item:Q3207683"
From MaRDI portal
The following pages link to Some more problems on elementary geometry (Q3207683):
Displaying 49 items.
- Almost empty monochromatic triangles in planar point sets (Q299089) (← links)
- On pseudo-convex partitions of a planar point set (Q389454) (← links)
- On balanced 4-holes in bichromatic point sets (Q482334) (← links)
- Blocking the \(k\)-holes of point sets in the plane (Q497316) (← 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)
- Two disjoint 5-holes in point sets (Q827302) (← 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)
- Nineteen problems on elementary geometry (Q1343286) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← 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)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← 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)
- Points defining triangles with distinct circumradii (Q2341939) (← links)
- Empty triangles in good drawings of the complete graph (Q2345507) (← links)
- Drawing the almost convex set in an integer grid of minimum size (Q2401331) (← 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)
- Empty convex hexagons in planar point sets (Q2482196) (← links)
- On the number of edges in geometric graphs without empty triangles (Q2637713) (← links)
- On geometric graphs on point sets in the plane (Q2695466) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- On Erdős-Szekeres-type problems (Q2851501) (← links)
- On some geometrical problems (Q3286021) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- On the Erdős–Szekeres problem in combinatorial geometry (Q3503469) (← links)
- (Q3866142) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- Convex polygons in Cartesian products (Q5088949) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← 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)
- A SAT attack on higher dimensional Erdős-Szekeres numbers (Q6604680) (← links)
- On disjoint holes in point sets (Q6621264) (← links)
- Erdős-Szekeres-type problems in the real projective plane (Q6642299) (← links)
