Characterizing infinite graphs allowing flexible frameworks


A planar framework, which is a graph together with a map of its vertices to the plane, is flexible if it allows a continuous deformation preserving the distances between adjacent vertices. It has been shown recently that a finite graph admits a flexible framework if and only if it has a so called NAC-coloring, which is an edge coloring with a condition on cycles. We extend this result to the case of frameworks with countable vertex sets. This is a joint work with M. Gallet and J. Schicho

Jan Legerský
Assistant Lecturer