Timeline for Locally "unshortable" paths in graphs
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28 at 16:06 | comment | added | Alexander Chervov | @JoshuaZ trivial example - full graph - so d = 1, any path is "unshortable" So for highly connected graphs - it is something similar can get very long paths since "d" is small. But the interesting cases - when "d" is higher. For example even if take the simplest lattice - (Z/n)^d (its Cayley graph) what is the maximal length of the "unshortable" path ? | |
| Jan 28 at 15:56 | comment | added | JoshuaZ | " but there can be longer paths which are still unshortable. " Do you have a smallish example of this? | |
| Jan 28 at 10:18 | history | edited | Alexander Chervov | CC BY-SA 4.0 |
added 86 characters in body
|
| Jan 28 at 10:10 | history | asked | Alexander Chervov | CC BY-SA 4.0 |