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.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: