Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs

F. Botler, Y. S. Couto, C. G. Fernandes +4

Chernyshev, Rauch, and Rautenbach proved that every connected graph on $n$ vertices with less than $\frac{11}{5}n-\frac{18}{5}$ edges has a vertex cut that induces a forest, and co…