12 citations · 23 across the 7 of their papers we have counts for
1 paper · 2 filters
Bill Jackson, Hakan Guler
A graph G=(V,E) is d-sparse if each subset X⊆V with ∣X∣≥d induces at most d∣X∣−(2d+1) edges in G. Maxwell showed in 1864 that a necessary condit…