On the edge set of graphs of lattice paths

This note explores a new family of graphs defined on the set of paths of the m×n lattice. We let each of the paths of the lattice be represented by a vertex, and connect two vertices by an edge if the corresponding paths share more than k steps, where k is a fixed parameter 0=k=m