Decreasing maximum average degree by deleting independent set or d-degenerate subgraph
share
The maximum average degree mad(G) of a graph G is the maximum average degree over all subgraphs of G. In this paper we prove that for every G and positive integer k such that mad(G) > k there exists S ⊆ V(G) such that mad(G - S) <mad(G) - k and G[S] is (k-1)-degenerate. Moreover, such S can be computed in polynomial time. In particular there exists an independent set I in G such that mad(G-I) <mad(G)-1 and an induced forest F such that mad(G-F) <mad(G) - 2.
READ FULL TEXT