WorksMathematics
Removable forests in -connected and -edge-connected graphs
Abstract
We prove the forest conjecture of Clay and Jordán: Let be an integer and let be a forest with vertices and edges. If a -connected graph has minimum degree at least , then it contains a copy of whose edge deletion preserves -connectivity. We also prove the -edge-connectivity version.