# Edge-disjoint spanning subgraphs of large degree

Prove the following: you can always find in a simple undirected graph $G$ of minimum degree $\delta$ two spanning edge disjoint subgraphs of minimum degree at least $\lfloor \frac{\delta-1}{2} \rfloor$. Give also an algorithmic procedure to find such subgraphs.