Konvexe Fünfecke in ebenen Punktmengen
From MaRDI portal
Publication:1253812
zbMath0397.52005MaRDI QIDQ1253812
Publication date: 1978
Published in: Elemente der Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/141217
Related Items
Drawing the Horton set in an integer grid of minimum size, On convex holes in d-dimensional point sets, Two disjoint 5-holes in point sets, Some Erdős-Szekeres type results about points in space, On empty convex polygons in a planar point set, Almost empty monochromatic triangles in planar point sets, Problems and results in discrete mathematics, On empty convex polytopes, A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets, On the number of edges in geometric graphs without empty triangles, Mathematical problems and games, On weighted sums of numbers of convex polygons in point sets, On a partition into convex polygons, Topologically sweeping an arrangement, A Ramsey property of order types, Carathéodory's theorem in depth, On the generalized Erdös-Szekeres conjecture -- a new upper bound, On pseudo-convex partitions of a planar point set, Holes and islands in random point sets, On the Erdős–Szekeres problem in combinatorial geometry, Fixing a hole, On \(k\)-gons and \(k\)-holes in point sets, On the minimum number of mutually disjoint holes in planar point sets, Large convex holes in random point sets, Chromatic variants of the Erdős--Szekeres theorem on points in convex position., Point sets with small integer coordinates and no large convex polygons, Interior points in the Erdős-Szekeres theorems, Searching for empty convex polygons, Empty squares in arbitrary orientation among points, Lower bounds for the number of small convex \(k\)-holes, Unnamed Item, 4-holes in point sets, Almost empty hexagons, Every large point set contains many collinear points or an empty pentagon, On balanced 4-holes in bichromatic point sets, Some notes on the Erdős-Szekeres theorem, Convex independent sets and 7-holes in restricted planar point sets, On 5-Gons and 5-Holes, A Note on the Number of Empty Triangles, A simple proof for open cups and caps, Cells in any simple polygon formed by a planar point set, Blocking the \(k\)-holes of point sets in the plane, Decompositions, partitions, and coverings with convex polygons and pseudo-triangles, Empty rainbow triangles in \(k\)-colored point sets, A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\), Specified holes with pairwise disjoint interiors in planar point sets, A note on the value in the disjoint convex partition problem, On \(k\)-convex point sets, Sets in \(\mathbb{R}^ d\) with no large empty convex subsets, Disjoint empty convex pentagons in planar point sets, Empty convex hexagons in planar point sets, Disjoint empty convex polygons in planar point sets, On an empty triangle with the maximum area in planar point sets, Holes in 2-convex point sets, On the number of disjoint convex quadrilaterals for a planar point set, Almost empty monochromatic quadrilaterals in planar point sets, On the Erdős-Szekeres \(n\)-interior-point problem, On almost empty monochromatic triangles and convex quadrilaterals in colored point sets, On Erdős-Szekeres-type problems for \(k\)-convex point sets, On the minimum size of a point set containing a 5-hole and double disjoint 3-holes, Erdős-Szekeres theorem for lines, A superlinear lower bound on the number of 5-holes, Faster counting empty convex polygons in a planar point set, The Erdős-Szekeres Problem, On Erdős-Szekeres-type problems, New proofs about the number of empty convex 4-gons and 5-gons in a planar point set, A note on the upper bound for disjoint convex partitions, The Erdos-Szekeres problem on points in convex position – a survey, Empty triangles in good drawings of the complete graph, Connectivity of triangulation flip graphs in the plane
