Ramsey unsaturated and saturated graphs

Journal of Graph Theory

Volumn 51, Issue 1, 2006, Pages 22-32

  Balister, P ^a   Lehel, J ^a   Schelp, R H ^a  

^a University of Memphis   (United States)

Author keywords

Cycles; Extremal graphs; Paths; Ramsey theory

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; PETRI NETS; TREES (MATHEMATICS);

CYCLES; EXTREMAL GRAPHS; PATHS; RAMSEY THEORY;

GRAPH THEORY;

EID: 33645319949     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20118     Document Type: Article

References (12)

1. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics, 184, Springer-Verlag, New York, 1998, xiv +394pp.
2. S. A. Burr, P. Erd″os, R. J. Faudree, and R. H. Schelp, On the difference between consecutive Ramsey numbers, Utilitas Math 35 (1989), 115-118.
3. S. A. Burr and J. A. Roberts, On Ramsey numbers for stars, Utilitas Math 4 (1973), 217-220.
4. P. Erd″os, Extremal problems in graph theory, In Theory of Graphs and its Applications, M. Fiedler, (Editor), Academic Press, New York, 1965, pp. 26-36.
5. R. J. Faudree and R. H. Schelp, All Ramsey numbers for cycles in graphs, Discrete Math 8 (1974), 313-329.
6. L. Gerencsér and A. Gyárfás, On Ramsey-type problems, Ann Univ Sci Budapest Eötvös Sect Math 10 (1967), 167-170.
7. G. R. T. Hendry, Diagonal Ramsey numbers for graphs with seven edges, Utilitas Math 32 (1987), 11-34.
8. G. R. T. Hendry, Ramsey numbers for graphs with five vertices, J Graph Theory 13 (1989), 245-248.
9. 2/log t, Random Struct Algorithms 7(3) (1995), 173-207.
10. V. Nikiforov, C. C. Rousseau, and R. H. Schelp, Book Ramsey numbers and quasi-randomness, to appear in Combinatorics, Probability and Computing.
11. S. Radziszowski, Small Ramsey numbers, Electron J Combin (2002), Dynamic Survey 1.9.
12. V. Rosta, On a Ramsey-type problem of J. A. Bondy and P. Erd″os, I and II, J Combin Theory Ser B 15 (1973), 94-120.