We prove a number of Turán and Ramsey type stability results for cycles, in particular, the following one: Let , , and the edges of be 2-colored so that no monochromatic exists. Then, for some , we may drop a vertex v so that in one of the colors induces , while the other one induces . We also derive the following Ramsey type result. If n is sufficiently large and G is a graph of order , with minimum degree , then for every 2-coloring of one of the colors contains cycles for all .