Pages that link to "Item:Q1253812"
From MaRDI portal
The following pages link to Konvexe Fünfecke in ebenen Punktmengen (Q1253812):
Displaying 50 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)
- 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)
- 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)
- Searching for empty convex polygons (Q911758) (← links)
- Cells in any simple polygon formed by a planar point set (Q942099) (← links)
- Mathematical problems and games (Q1101091) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- On the generalized Erdös-Szekeres conjecture -- a new upper bound (Q1126297) (← links)
- Some notes on the Erdős-Szekeres theorem (Q1182859) (← links)
- Convex independent sets and 7-holes in restricted planar point sets (Q1184157) (← links)
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets (Q1201240) (← links)
- Some Erdős-Szekeres type results about points in space (Q1335532) (← links)
- Problems and results in discrete mathematics (Q1344612) (← links)
- On empty convex polytopes (Q1346996) (← links)
- A Ramsey property of order types (Q1380338) (← 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)
- On a partition into convex polygons (Q1917247) (← 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)
- Connectivity of triangulation flip graphs in the plane (Q2105329) (← 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 an empty triangle with the maximum area in planar point sets (Q2275445) (← 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)
- On empty convex polygons in a planar point set (Q2368650) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Interior points in the Erdős-Szekeres theorems (Q2435979) (← 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)
- A simple proof for open cups and caps (Q2462332) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Empty convex hexagons in planar point sets (Q2482196) (← links)
