Forbidden Configurations in Discrete Geometry
From MaRDI portal
Publication:4569672
DOI10.1017/9781108539180zbMath1417.52001MaRDI QIDQ4569672
Publication date: 27 June 2018
Full work available at URL: https://doi.org/10.1017/9781108539180
52B55: Computational aspects related to convexity
05B30: Other designs, configurations
52C10: Erd?s problems and related topics of discrete geometry
52-02: Research exposition (monographs, survey articles) pertaining to convex and discrete geometry
Related Items
The Parameterized Complexity of Finding Point Sets with Hereditary Properties, Cubic Planar Graphs that cannot be Drawn on few Lines, Unnamed Item, The extensible no-three-in-line problem, Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set, Geometric dominating sets -- a minimum version of the no-three-in-line problem, 4-connected triangulations on few lines, Line and plane cover numbers revisited, Counting polygon triangulations is hard, Bottleneck convex subsets: finding \(k\) large convex sets in a point set