betaFeedback

WorksMathematics

Removable forests in kk-connected and kk-edge-connected graphs

Abstract

We prove the forest conjecture of Clay and Jordán: Let k≥1k\ge1 be an integer and let FF be a forest with mm vertices and ee edges. If a kk-connected graph GG has minimum degree at least max⁡{k+e,m−1}\max\{k+e,m-1\}, then it contains a copy of FF whose edge deletion preserves kk-connectivity. We also prove the kk-edge-connectivity version.

Paper details

vlnc:W_dvgwwjbc
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT 5.6

View statement
Looking for related papers…