Paths, cycles and wheels in graphs without antitriangles
Stanisław Radziszowski, Xia Jin · 1994
Abstract. We investigate paths, cycles and wheels in graphs with independence number of at most 2, in particular we prove theorems characterizing ali such graphs which are hamiltonian. Ramsey numbers of the form R (G, K 3) ' for G being a path, a cycle or a wheel, are known to be 2n (G) 1, except for some small cases. In this paper we derive and count all critical graphs for these Ramsey numbers.