17 citations · 57 across the 36 of their papers we have counts for
1 paper · 1 filter
Sergey Norin, Liana Yepremyan
Erdős conjectured that every triangle-free graph G on n vertices contains a set of ⌊n/2⌋ vertices that spans at most n2/50 edges. Krivelevich proved the con…