Low-distortion embeddings of graphs with large girth
From MaRDI portal
Publication:413201
DOI10.1016/j.jfa.2012.01.020zbMath1244.46036arXiv1108.2542OpenAlexW2962813142MaRDI QIDQ413201
Publication date: 4 May 2012
Published in: Journal of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2542
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coarse non-amenability and coarse embeddings
- Explicit construction of regular graphs without small cycles
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Explicit constructions of graphs without short cycles and low density codes
- Generating all graph coverings by permutation voltage assignments
- Girth and Euclidean distortion
- The geometry of graphs and some of its algorithmic applications
- The coarse Baum-Connes conjecture for spaces which admit a uniform embedding into Hilbert space
- Coarsely embeddable metric spaces without Property A
- PROPERTY A AND GRAPHS WITH LARGE GIRTH
- L_1 embeddings of the Heisenberg group and fast estimation of graph isoperimetry
- Minors in lifts of graphs
- Random Lifts of Graphs: Edge Expansion
This page was built for publication: Low-distortion embeddings of graphs with large girth