A combinatorial problem in geometry
P. Erdös, G. Szekeres (1935)
Compositio Mathematica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Another abstraction of the Erdős-Szekeres happy end theorem.”
A combinatorial problem in geometry
Large convexly independent subsets of Minkowski sums.
Swanepoel, Konrad J., Valtr, Pavel (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Convexly independent subsets of the Minkowski sum of planar point sets.
Eisenbrand, Friedrich, Pach, János, Rothvoß, Thomas, Sopher, Nir B. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Convex half-spaces
Marek Lassak (1984)
Fundamenta Mathematicae
Similarity:
A Helly number for unions of two boxes in .
Breen, Marilyn (1985)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the area sum of a convex set and its polar reciprocal.
Florian, August (1996)
Mathematica Pannonica
Similarity:
A universal convex set in Euclidean space
Ryszard Grząślewicz (1981)
Colloquium Mathematicae
Similarity:
The Gergonne point generalized through convex coordinates.
Boyd, J.N., Raychowdhury, P.N. (1999)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Convex hulls of spatial polygons with a fixed convex projection.
Dekster, Boris V. (1995)
Beiträge zur Algebra und Geometrie
Similarity:
The isoperimetric inequality for a pentagon in and its generalization in space
Milada Kočandrlová (1982)
Časopis pro pěstování matematiky
Similarity: