Subset selection problems in planar point sets
From MaRDI portal
Cites work
- A combinatorial problem in geometry.
- A density version of the Hales-Jewett theorem for \(k=3\)
- A new lower bound on Hadwiger-Debrunner numbers in the plane
- A note on arrays of dots with distinct slopes
- Additive combinatorics
- Applications of sparse hypergraph colorings
- Approximate formulas for some functions of prime numbers
- Arcs in \(\mathbb{F}_q^2\)
- Bounds for arrays of dots with distinct slopes or lengths
- Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem
- Coloring sparse hypergraphs
- Counting arcs in \(\mathbb{F}_q^2\)
- Extremal problems in discrete geometry
- Forbidden configurations in discrete geometry
- scientific article; zbMATH DE number 4014740 (Why is no real title available?)
- Hypergraph containers
- Independent sets in hypergraphs
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- On higher dimensional point sets in general position
- On maximal convex lattice polygons inscribed in a plane convex set
- On some metric and combinatorial geometric problems
- On the Erdős distinct distances problem in the plane
- On the expression of a number as the sum of two squares.
- On the General Position Subset Selection Problem
- On the number of points in general position in the plane
- On the use of the Klein quadric for geometric incidence problems in two dimensions
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Random Turán and counting results for general position sets over finite fields
- Research problems in discrete geometry
- Topics in the theory of numbers. Translated from the Hungarian by Barry Guiduli.
- Two geometrical applications of the semi-random method
- Über die Gitterpunkte auf konvexen Kurven.
This page was built for publication: Subset selection problems in planar point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444074)