1 paper · 1 filter
Samuel Harris, Zion Hefty, Paul Horn +2
We give a nibble-free construction proving R(3,k)≥(1/200+o(1))k2/logk. We also include Shearer's proof bounding the independence number of a triangle-free graph, which impli…