Cycles and stability

Authors:
V. Nikiforov;R. H. Schelp
Affiliations:
Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA;Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA
Venue:
Journal of Combinatorial Theory Series B
Year:
2008

Citing 4
Cited 1

Basic graph theory: paths and circuits

Handbook of combinatorics (vol. 1)
Cycles in 2-connected graphs

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Book Ramsey Numbers and Quasi-Randomness

Combinatorics, Probability and Computing
Weakly pancyclic graphs

Journal of Graph Theory

A multipartite Ramsey number for odd cycles

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove a number of Turan and Ramsey type stability results for cycles, in particular, the following one: Let n4, 0=(2-10^-^6)n, then for every 2-coloring of E(G) one of the colors contains cycles C"t for all t@?[3,n].