1 paper
Adam Džavoronok, Ole Gabsdil, Alexander Mylet +2
A graph Γ is (c,t)-sparse for c>0 and t≥1 if for every pair of vertex subsets A,B⊆V(Γ) with ∣A∣,∣B∣≥t, the number of edges e(A,B) between them s…