Hostname: page-component-54dcc4c588-smtgx Total loading time: 0 Render date: 2025-10-11T16:52:56.803Z Has data issue: true hasContentIssue false
  • English
  • Français

Distance Preserving Ramsey Graphs

Published online by Cambridge University Press:  23 April 2012

DOMINGOS DELLAMONICA Jr  and
VOJTĚCH RÖDL
DOMINGOS DELLAMONICA Jr
Affiliation:
Department of Mathematics and Computer Science, Emory University, 400 Dowman Dr., W401, Atlanta, GA 30322, USA (e-mail: ddellam@mathcs.emory.edu, rodl@mathcs.emory.edu)
VOJTĚCH RÖDL
Affiliation:
Department of Mathematics and Computer Science, Emory University, 400 Dowman Dr., W401, Atlanta, GA 30322, USA (e-mail: ddellam@mathcs.emory.edu, rodl@mathcs.emory.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We prove the following metric Ramsey theorem. For any connected graph G endowed with a linear order on its vertex set, there exists a graph R such that in every colouring of the t-sets of vertices of R it is possible to find a copy G* of G inside R satisfying:

  • • distG*(x, y) = distR(x, y) for every x, y ∈ V(G*);

  • • the colour of each t-set in G* depends only on the graph-distance metric induced in G by the ordered t-set.

Keywords

Primary 05C55

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 21 , Issue 4 , July 2012 , pp. 554 - 581
Copyright
Copyright © Cambridge University Press 2012

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.)

Article purchase

Temporarily unavailable