On Metric Ramsey-type Dichotomies

dc.creatorBartal, Yair
dc.creatorLinial, Nathan
dc.creatorMendel, Manor
dc.creatorNaor, Assaf
dc.date2004-06-18
dc.date.accessioned2026-07-07T05:09:22Z
dc.date.available2026-07-07T05:09:22Z
dc.descriptionThe classical Ramsey theorem, states that every graph contains either a large clique or a large independent set. Here we investigate similar dichotomic phenomena in the context of finite metric spaces. Namely, we prove statements of the form "Every finite metric space contains a large subspace that is nearly quilateral or far from being equilateral". We consider two distinct interpretations for being "far from equilateral". Proximity among metric spaces is quantified through the metric distortion D. We provide tight asymptotic answers for these problems. In particular, we show that a phase transition occurs at D=2.
dc.description14 pages, 0 figures
dc.identifierhttps://arxiv.org/abs/math/0406374
dc.identifierhttp://arxiv.org/abs/math/0406374
dc.identifierJ. London Math. Society 71(2): 289-303, 2005
dc.identifierdoi:10.1112/S0024610704006155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71606
dc.subjectCombinatorics
dc.subject52C45; 05C55; 54E40; 05C12; 54E40
dc.titleOn Metric Ramsey-type Dichotomies
dc.typetext

Files

Collections