Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph release_ztsftgjfs5a37crsxc64dninzq

by Wojciech Nadara, Marcin Smulewicz

Published in Electronic Journal of Combinatorics by The Electronic Journal of Combinatorics.

2022   Volume 29

Abstract

The maximum average degree $\mathrm{mad}(G)$ of a graph $G$ is the maximum over all subgraphs of $G$, of the average degree of the subgraph. In this paper, we prove that for every $G$ and positive integer $k$ such that $\mathrm{mad}(G) \ge k$ there exists $S \subseteq V(G)$ such that $\mathrm{mad}(G - S) \le \mathrm{mad}(G) - k$ and $G[S]$ is $(k-1)$-degenerate. Moreover, such $S$ can be computed in polynomial time. In particular, if $G$ contains at least one edge then there exists an independent set $I$ in $G$ such that $\mathrm{mad}(G-I) \le \mathrm{mad}(G)-1$ and if $G$ contains a~cycle then there exists an induced forest $F$ such that $\mathrm{mad}(G-F) \le \mathrm{mad}(G) - 2$. As a side result, we also obtain a subexponential bound on the diameter of reconfiguration graphs of generalized colourings of graphs with bounded value of their $\mathrm{mad}$.
In application/xml+jats format

Archived Files and Locations

application/pdf  337.0 kB
file_grd4xnvbz5c43ahwnufgvzj36y
www.combinatorics.org (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2022-03-11
Journal Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  1077-8926
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 7b14717d-bd42-49d7-bab3-e374c8498338
API URL: JSON