Michał Pilipczuk, Structural properties of powers of sparse graphs
Zoom ID: 869 4632 6610 (ibsdimag)For a graph G and an integer d, the dth power of G is the graph $G^d$ on the same vertex set as G where two vertices are considered adjacent if and only if they are at distance at most d in G. Assuming that G is sparse, what can we say about the structure …