Timeline for Trees in groups of exponential growth
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 9, 2013 at 16:01 | history | edited | Lee Mosher |
edited tags
|
|
| May 9, 2013 at 15:45 | answer | added | Dan Sălăjan | timeline score: 5 | |
| Apr 19, 2011 at 19:48 | answer | added | Alain Valette | timeline score: 4 | |
| Apr 3, 2011 at 17:01 | history | edited | Andreas Thom | CC BY-SA 2.5 |
deleted 4 characters in body
|
| Apr 3, 2011 at 16:40 | history | edited | Andreas Thom | CC BY-SA 2.5 |
added 288 characters in body; deleted 12 characters in body
|
| Apr 3, 2011 at 14:37 | answer | added | Al Tal | timeline score: 8 | |
| Mar 30, 2011 at 1:22 | answer | added | user6976 | timeline score: 12 | |
| Mar 29, 2011 at 19:43 | comment | added | Andreas Thom | If you can do it in a bi-Lipschitz way, then you can embed it as a graph with a larger generating set. In general, to find an isometric copy is a harder question, but of course related. For the moment, I am only interested in the question that I asked, i.e. contains means containment in the sense of subgraphs. | |
| Mar 29, 2011 at 19:26 | comment | added | Bill Johnson | Do you mean contains a tree isometrically? If only up to biLipschitz equivalence, it looks to me like the answer does not depend on the generating set. | |
| Mar 29, 2011 at 19:16 | history | asked | Andreas Thom | CC BY-SA 2.5 |