Nonexistence of Embeddings With Uniformly Bounded Distortions of Laakso Graphs Into Diamond Graphs
Loading...

Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Science Bv
Open Access Color
HYBRID
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
Diamond graphs and Laakso graphs are important examples in the theory of metric embeddings. Many results for these families of graphs are similar to each other. In this connection, it is natural to ask whether one of these families admits uniformly bilipschitz embeddings into the other. The well-known fact that Laakso graphs are uniformly doubling but diamond graphs are not, immediately implies that diamond graphs do not admit uniformly bilipschitz embeddings into Laakso graphs. The main goal of this paper is to prove that Laakso graphs do not admit uniformly bilipschitz embeddings into diamond graphs. (C) 2016 Elsevier B.V. All rights reserved.
Description
Keywords
Diamond graphs, Doubling metric space, Laakso space, Lipschitz map, Mathematics - Functional Analysis, Mathematics - Metric Geometry, 05C12, 30L05, 46B85, FOS: Mathematics, Mathematics - Combinatorics, Metric Geometry (math.MG), Combinatorics (math.CO), Functional Analysis (math.FA), Distance in graphs, diamond graphs, doubling metric space, Laakso space, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), Lipschitz map
Fields of Science
0102 computer and information sciences, 0101 mathematics, 01 natural sciences
Citation
WoS Q
Q2
Scopus Q
Q4

OpenCitations Citation Count
4
Source
Discrete Mathematics
Volume
340
Issue
2
Start Page
9
End Page
17
PlumX Metrics
Citations
CrossRef : 3
Scopus : 4
Captures
Mendeley Readers : 4
SCOPUS™ Citations
4
checked on Feb 14, 2026
Web of Science™ Citations
4
checked on Feb 14, 2026
Page Views
2
checked on Feb 14, 2026
Google Scholar™


