scientific article; zbMATH DE number 3649571
Der Verf. erörtert in knapper Form die folgenden Aufgaben für endliche Punktmengen in der Ebene: 1. Wie groß ist zu gegebener Zahl \(K\) die kleinste Zahl \(n_k\) derart, daß man unter beliebigen \(n_k\) Punkten in allgemeiner Lage (d.h. weder drei auf einer Geraden noch vier auf einem (Kreis) stets mindestens \(k\) finden kann, deren \(\binom{k}{3}\) Verbindungskreise sämtlich verschiedene Durchmesser haben? 2. Wie groß ist zu gegebenem \(n\) die kleinste Zahl \(f(n)\) der in einer beliebigen Menge von \(n\) Punkten in allgemeiner Lage enthaltenen konvexen Teilmengen? 3. Wie groß ist zu gegebenen \(k\) die kleinste Zahl \(m_k\) derart, daß man unter beliebigen \(m_k\) Punkten in allgemeiner Lage stets \(k\) finden kann, die die Ecken eines konvexen \(k\)-Ecks bilden? 4. Wie groß ist zu gegebenen \(n\) die kleinste Zahl \(h(n)\) der in einer beliebigen Menge von \(n\) Punkten in allgemeiner Lage enthaltenen konvexen Teilmengen, die keinen Punkt der Ausgangsmenge einschließen? Zu Nr. 1-3 werden Abschätzungen gegeben. Zu Nr. 4 beschränkt sich der Verf. auf den Hinweis, daß es für \(n\geq 5\) stets ein konvexes Viereck ohne inneren Punkt und für hinreichend große \(n\) auch ein entsprechendes Fünfeck gibt.
- Nineteen problems on elementary geometry
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- Drawing the Horton set in an integer grid of minimum size
- Point sets with small integer coordinates and no large convex polygons
- Large convex holes in random point sets
- Empty rainbow triangles in \(k\)-colored point sets
- A note on empty balanced tetrahedra in two-colored point sets in \(\mathbb{R}^3\)
- Faster counting empty convex polygons in a planar point set
- On \(k\)-convex point sets
- Disjoint empty convex pentagons in planar point sets
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
- A superlinear lower bound on the number of 5-holes
- Points defining triangles with distinct circumradii
- Empty triangles in good drawings of the complete graph
- Drawing the almost convex set in an integer grid of minimum size
- Lower bounds for the number of small convex \(k\)-holes
- 4-holes in point sets
- Almost empty hexagons
- Empty convex hexagons in planar point sets
- On the number of edges in geometric graphs without empty triangles
- On geometric graphs on point sets in the plane
- Empty squares in arbitrary orientation among points
- The Erdős-Szekeres Problem
- On Erdős-Szekeres-type problems
- Almost empty monochromatic triangles in planar point sets
- scientific article; zbMATH DE number 3167519 (Why is no real title available?)
- Convex polygons in geometric triangulations
- On the Erdős–Szekeres problem in combinatorial geometry
- scientific article; zbMATH DE number 3961669 (Why is no real title available?)
- scientific article; zbMATH DE number 3668647 (Why is no real title available?)
- On pseudo-convex partitions of a planar point set
- The Erdos-Szekeres problem on points in convex position – a survey
- On balanced 4-holes in bichromatic point sets
- Blocking the \(k\)-holes of point sets in the plane
- Convex polygons in Cartesian products
- Convex Polygons in Geometric Triangulations
- Holes in 2-convex point sets
- On Erdős-Szekeres-type problems for \(k\)-convex point sets
- Holes and islands in random point sets
- Tight bounds on the expected number of holes in random point sets
- Fixing a hole
- A SAT attack on Erdős-Szekeres numbers in \(\mathbb{R}^d\) and the empty hexagon theorem
- A SAT attack on higher dimensional Erdős-Szekeres numbers
- On disjoint holes in point sets
- Erdős-Szekeres-type problems in the real projective plane
- On Erdős-Szekeres Maker-Breaker games
- Holes in convex and simple drawings
- Almost empty monochromatic polygons in planar point sets
- Almost empty monochromatic quadrilaterals in planar point sets
- Holes in convex and simple drawings
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- Two disjoint 5-holes in point sets
- On \(k\)-gons and \(k\)-holes in point sets
- On the minimum number of mutually disjoint holes in planar point sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3207683)