Skip to main content
Log in

NOTE The Johnson Graphs Satisfy a Distance Extension Property

  • Note
  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received June 9, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dabrowski, A., Moss, L. NOTE The Johnson Graphs Satisfy a Distance Extension Property. Combinatorica 20, 295–300 (2000). https://doi.org/10.1007/s004930070027

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930070027

Navigation