Another abstraction of the Erdős-Szekeres happy end theorem.
Alon, Noga, Chiniforooshan, Ehsan, Chvátal, Vašek, Genest, François (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Large convexly independent subsets of Minkowski sums.”
Another abstraction of the Erdős-Szekeres happy end theorem.
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:
The isoperimetric inequality for a pentagon in and its generalization in space
Milada Kočandrlová (1982)
Časopis pro pěstování matematiky
Similarity:
On a special family of compact convex sets in the Euclidean plane .
Kramer, Horst (2006)
Mathematica Pannonica
Similarity:
A combinatorial problem in geometry
P. Erdös, G. Szekeres (1935)
Compositio Mathematica
Similarity:
A Helly number for unions of two boxes in .
Breen, Marilyn (1985)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Convex half-spaces
Marek Lassak (1984)
Fundamenta Mathematicae
Similarity:
Continuous choice functions and convexity
Sherman Stein (1958)
Fundamenta Mathematicae
Similarity:
A universal convex set in Euclidean space
Ryszard Grząślewicz (1981)
Colloquium Mathematicae
Similarity:
On the chromatic number of intersection graphs of convex sets in the plane.
Kim, Seog-Jin, Kostochka, Alexandr, Nakprasit, Kittikorn (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity: