An Inductive Construction of (2,1)-tight Graphs

Anthony Nixon, John Owen

The simple graphs $G=(V,E)$ that satisfy $|E^{\prime }|\le 2|V^{\prime }|-l$ for any subgraph (and for $l=1,2,3$) are the $(2,l)$-sparse graphs. Those that also satisfy $|E|=2|V|-l$ are the $(2,l)$…