Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-26T09:29:49.962Z Has data issue: false hasContentIssue false

ON METRIC RAMSEY-TYPE DICHOTOMIES

Published online by Cambridge University Press:  06 April 2005

YAIR BARTAL
Affiliation:
Institute of Computer Science, Hebrew University, Jerusalem 91904, Israelyair@cs.huji.ac.il, nati@cs.huji.ac.il, mendelma@cs.huji.ac.il
NATHAN LINIAL
Affiliation:
Institute of Computer Science, Hebrew University, Jerusalem 91904, Israelyair@cs.huji.ac.il, nati@cs.huji.ac.il, mendelma@cs.huji.ac.il
MANOR MENDEL
Affiliation:
Institute of Computer Science, Hebrew University, Jerusalem 91904, Israelyair@cs.huji.ac.il, nati@cs.huji.ac.il, mendelma@cs.huji.ac.il
ASSAF NAOR
Affiliation:
Theory Group, Microsoft Research, One Microsoft Way 113/2131, Redmond, WA 98052-6399, USAanaor@microsoft.com
Get access

Abstract

The classical Ramsey theorem states that every graph contains either a large clique or a large independent set. Here similar dichotomic phenomena are investigated in the context of finite metric spaces. Namely, statements are provided of the form ‘every finite metric space contains a large subspace that is nearly equilateral or far from being equilateral’. Two distinct interpretations are considered for being ‘far from equilateral’. Proximity among metric spaces is quantified through the metric distortion $\alpha$. Tight asymptotic answers are provided for these problems. In particular, it is shown that a phase transition occurs at $\alpha=2$.

Type
Notes and Papers
Copyright
The London Mathematical Society 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)