scientific article; zbMATH DE number 3354154

zbMath0223.52009MaRDI QIDQ5628820

J. G. Kalbfleisch, Ralph G.Stanton, John D. Kalbfleisch

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Other problems of combinatorial convexity (52A37)

Related Items

Some Erdős-Szekeres type results about points in space, Almost empty monochromatic triangles in planar point sets, Covering the convex quadrilaterals of point sets, Erdős-Szekeres without induction, Nine convex sets determine a pentagon with convex sets as vertices, On \(k\)-gons and \(k\)-holes in point sets, On the minimum number of mutually disjoint holes in planar point sets, Unnamed Item, Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points, Specified holes with pairwise disjoint interiors in planar point sets, On the existence of a point subset with 3 or 6 interior points, Almost empty monochromatic quadrilaterals in planar point sets, On almost empty monochromatic triangles and convex quadrilaterals in colored point sets, More on planar point subsets with a specified number of interior points, The Erdős-Szekeres Problem, More on an Erdős-Szekeres-type problem for interior points, A note on the upper bound for disjoint convex partitions, The Erdos-Szekeres problem on points in convex position – a survey