Local Certification of Vertex and Edge Connectivity

Local certification is a framework for verifying global graph properties using only local information. In this model, a prover assigns short labels, called certificates, to the vertices of a graph. Each vertex then exchanges certificates with its neighbors and performs a purely local check to determine whether the graph satisfies the desired property. This line of research has led to efficient certification schemes for a broad range of graph classes, including minor-closed families, topological graph classes, and graphs defined by forbidden subgraphs. In this paper, we study the local certification of graph connectivity. Prior work by Bousquet, Feuilloley, and Pierron (JPDC 2024) showed that $2$-vertex-connectivity, $2$-edge-connectivity, and $3$-vertex-connectivity admit $O(\log n)$-bit certificates, leveraging structural characterizations such as ear decompositions. We go substantially beyond these cases and investigate general $k$-vertex-connectivity and $k$-edge-connectivity. We develop new approaches that exploit connections between connectivity and combinatorial structures, including branchings, Eulerian subgraphs, and independent spanning trees. For $k$-edge-connectivity, we obtain an $O_k(\log n)$-bit certification scheme and prove a matching $\Omega_k(\log n)$ lower bound for every $k\ge 3$. The lower bound also applies to $k$-vertex-connectivity. For $k$-vertex-connectivity, we obtain $\tilde{O}_k(\sqrt{n})$-bit certificates for every $k$ under a conjecture of Itai and Zehavi. We further show that, for $k=2$, the logarithmic barrier can be broken on sparse graph classes: $2$-edge-connectivity admits constant-size certificates in bounded-expansion graphs, and $2$-vertex-connectivity admits constant-size certificates in bounded-degree graphs. In contrast, for $2$-vertex-connectivity in general graphs, we prove an $\Omega(\log(\log^\ast n))$-bit lower bound.