Proof of `Arbitrarily Large Subcubic Graphs of Linear Treewidth`
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Choose a graph of order at least twice the additive constant. Its treewidth is positive, so the additive one is absorbed into twice the linear coefficient.