Claims

../

1980_12_01_wagon: Wagon (J. Combin. Theory Ser. B, 1980) bounds the chromatic number of graphs with no induced 2K_2 by C(omega+1,2), which gives d(t,2) at most C(t,2)+1: the case c = 2 for every t.

1985_12_01_el_zahar_erdos: El-Zahar and Erdős (Combinatorica, 1985) prove that d(t,3) exists for every t, with d(3,3) at most 8 and a polynomial bound for t > 3: the case c = 3.

---