WorksMathematics
Edge cuts of bounded degree in sparse graphs
Abstract
Every simple graph on vertices with at most edges can be split into two nonempty parts with at most two crossing edges at each vertex. For we bound the minimum number of edges in an n-vertex graph without a d-cut.