Connected graphs with fewer than 9/4 n - 15/4 edges always have a vertex cut inducing a forest, improving on the previous 11/5 n - 18/5 bound toward the conjectured 3n - 6.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
Connected graphs with fewer than 9/4 n - 15/4 edges always have a vertex cut inducing a forest, improving on the previous 11/5 n - 18/5 bound toward the conjectured 3n - 6.