Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Maria N. Prodromou"'
Autor:
Maria N. Prodromou
Publikováno v:
Discrete & Computational Geometry. 38:641-650
Any finite set X⊂ℝd colored with $\lfloor\frac {d+3}{2}\rfloor$ colors, contains a rainbow subset Y⊂X, such that any ball that contains Y contains a positive fraction of the points of X. The bound on the number of colors is tight.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4659c989a367b67db470929f45083cdf
https://doi.org/10.1007/s00454-007-9003-4
https://doi.org/10.1007/s00454-007-9003-4
Autor:
Maria N. Prodromou, Imre Bárány
Publikováno v:
Israel Journal of Mathematics. 154:337-360
Given a convex compact set K subset of R-2 what is the largest n such that K contains a convex lattice n-gon? We answer this question asymptotically. It turns out that the maximal n is related to the largest affine perimeter that a convex set contain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8c4bd36f93d907984eb5514fdc0ab07
https://doi.org/10.1007/bf02773612
https://doi.org/10.1007/bf02773612
Autor:
Maria N. Prodromou
Publikováno v:
Discrete Mathematics. 300:139-151
Let n be a positive integer and @[email protected]? any norm in R^2. Denote by B the unit ball of @[email protected]? and P"B","n the class of convex lattice polygons with n vertices and least @[email protected]?-perimeter. We prove that after suitab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::938cdd1c501151e455c2aeb5cec229a9
https://doi.org/10.1016/j.disc.2005.07.002
https://doi.org/10.1016/j.disc.2005.07.002