betaFeedback

WorksMathematics

Edge cuts of bounded degree in sparse graphs

Abstract

Every simple graph on n≥2n \ge 2 vertices with at most 2n−22n-2 edges can be split into two nonempty parts with at most two crossing edges at each vertex. For d≥3d \ge 3 we bound the minimum number of edges in an n-vertex graph without a d-cut.

Paper details

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

views · 10

downloads · 0

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

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…