Combinatorica

, Volume 20, Issue 2, pp 295–300 | Cite as

NOTE The Johnson Graphs Satisfy a Distance Extension Property

  • Andrew Dabrowski
  • Lawrence S. Moss
Note

G

has property \(\) if whenever F and H are connected graphs with \(\) and |H|=|F|+1, and \(\) and \(\) are isometric embeddings, then there is an isometric embedding \(\) such that \(\). It is easy to construct an infinite graph with \(\) for all k, and \(\) holds in almost all finite graphs. Prior to this work, it was not known whether there exist any finite graphs with \(\). We show that the Johnson graphs J(n,3) satisfy \(\) whenever \(\), and that J(6,3) is the smallest graph satisfying \(\). We also construct finite graphs satisfying \(\) and local versions of the extension axioms studied in connection with the Rado universal graph.

AMS Subject Classification (1991) Classes:  05C12, 05C80 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© János Bolyai Mathematical Society, 2000

Authors and Affiliations

  • Andrew Dabrowski
    • 1
  • Lawrence S. Moss
    • 2
  1. 1.Department of Mathematics, Indiana University; Bloomington, IN 47405, USA; E-mail: dabrowsa@indiana.eduUS
  2. 2.Department of Mathematics, Indiana University; Bloomington, IN 47405, USA; E-mail: lsm@cs.indiana.eduUS

Personalised recommendations