1 Introduction Given a graph , a cut of is the edge set between nonempty sets and . The sets and are partition classes (or, parts). A bisection is a cut in which the sizes of its parts differ by at most 1. A 3-regular graph is called cubic and a graph of maximum degree at most 3 is subcubic. The following result is well known (see, e.g., [1]) and the bound is tight for and . Theorem 1.1.Every subcubic graph has a cut with at least edges.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Anders
Contact Anders, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack