On the General Position Subset Selection Problem

DOI10.1137/120897493zbMath1348.52012arXiv1208.5289OpenAlexW2033635232MaRDI QIDQ5408587

David R. Wood, Michael S. Payne

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5289

zbMATH Keywords

discrete geometryErdős problemsgeneral position

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (22)

Additive combinatorics and graph theory ⋮ The general position achievement game played on graphs ⋮ On Subgraphs of Bounded Degeneracy in Hypergraphs ⋮ General position subsets and independent hyperplanes in \(d\)-space ⋮ General position sets in two families of Cartesian product graphs ⋮ The extensible no-three-in-line problem ⋮ The general position avoidance game and hardness of general position games ⋮ Finding Points in General Position ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The general position number of Cartesian products involving a factor with small diameter ⋮ A GENERAL POSITION PROBLEM IN GRAPH THEORY ⋮ Characterization of general position sets and its applications to cographs and bipartite graphs ⋮ Characterization of classes of graphs with large general position number ⋮ On general position sets in Cartesian products ⋮ The general position problem on Kneser graphs and on some graph operations ⋮ Unnamed Item ⋮ A new lower bound on Hadwiger-Debrunner numbers in the plane ⋮ Convex polygons in Cartesian products ⋮ On the General Position Number of Complementary Prisms ⋮ On the general position number of two classes of graphs ⋮ The edge general position problem ⋮ On independent position sets in graphs

This page was built for publication: On the General Position Subset Selection Problem