Timeline for Isometric embeddings of metric $K_{n+1}$ in $\mathbb{R}^n$
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 28, 2023 at 14:53 | history | edited | Manfred Weis | CC BY-SA 4.0 |
provided a counter example
|
| Nov 28, 2023 at 13:40 | comment | added | David E Speyer | See mathoverflow.net/questions/12394 for many references regarding this question | |
| Nov 28, 2023 at 12:13 | answer | added | M. Winter | timeline score: 1 | |
| Nov 28, 2023 at 12:10 | comment | added | Manfred Weis | @M.Winter a metriic graph is one in which for the edges of every triangle the triangle inequality holds for the edge-length. In a complete graph there is a connecting edge for every pair of distinct vertices a graph is symmetric if the length of an edge doesn't depend on the order of its adjacent edges | |
| Nov 28, 2023 at 12:05 | comment | added | M. Winter | What exactly is a complete, symmetric and metric graph? | |
| Nov 27, 2023 at 17:10 | vote | accept | Manfred Weis | ||
| Nov 27, 2023 at 16:54 | answer | added | Tony Huynh | timeline score: 8 | |
| Nov 27, 2023 at 16:26 | history | asked | Manfred Weis | CC BY-SA 4.0 |