2025/08/26 by Chandrasekaran, Karthekeyan, Chekuri, Chandra, Kulkarni, Shubhang
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.2508.18637
Bérczi, Chandrasekaran, Király, and Kulkarni (ICALP 2024) recently described a splitting-off procedure in hypergraphs that preserves local-connectivity and outlined some applications. In this note we give an alternative proof via element-connectivity preserving reduction operations in graphs.