For k≥3, certifying k-edge-connectivity requires and admits Θ(k log n)-bit labels, while k-vertex-connectivity gets O(k^3√n log^{2.5} n)-bit certificates (unconditionally for k=4, under the Itai–Zehavi conjecture for k≥5).
Title resolution pending
1 Pith paper cite this work, alongside 81 external citations. Polarity classification is still indexing.
1
Pith paper citing it
81
external citations · OpenAlex
fields
cs.DC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Local Certification of Vertex and Edge Connectivity
For k≥3, certifying k-edge-connectivity requires and admits Θ(k log n)-bit labels, while k-vertex-connectivity gets O(k^3√n log^{2.5} n)-bit certificates (unconditionally for k=4, under the Itai–Zehavi conjecture for k≥5).