A bound for the cops and robber problem in terms of 2-component order connectivity

Suryaansh Jain, Subrahmanyam Kalyanasundaram, Kartheek Sriram Tammana

In the cops and robber game, there are multiple cops and a single robber taking turns moving along the edges of a graph. The goal of the cops is to capture the robber (move to the…