1 paper
Laihao Ding, Jun Gao, Hong Liu +2
A graph G is (c,t)-sparse if for every pair of vertex subsets A,B⊂V(G) with ∣A∣,∣B∣≥t, e(A,B)≤(1−c)∣A∣∣B∣. In this paper we prove that for every c>0 and…