Cycles and stability

https://doi.org/10.1016/j.jctb.2007.05.001Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove a number of Turán and Ramsey type stability results for cycles, in particular, the following one: Let n>4, 0<β1/21/2n, and the edges of K(2β)n be 2-colored so that no monochromatic Cn exists. Then, for some q((1β)n1,n), we may drop a vertex v so that in K(2β)nv one of the colors induces Kq,(2β)nq1, while the other one induces KqK(2β)nq1. We also derive the following Ramsey type result. If n is sufficiently large and G is a graph of order 2n1, with minimum degree δ(G)(210−6)n, then for every 2-coloring of E(G) one of the colors contains cycles Ct for all t[3,n].

Keywords

Stability
Turán problems
Ramsey problems
Cycles

Cited by (0)