Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

Abstract

Let f1 and f2 be graph parameters. The Ramsey number r(f1m;f2n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G)⩾m or . A general existence condition is given and a general upper bound is shown in this paper. In addition, suppose the number of triangles in G is denoted by t(G). We verify that (1−o(1))(24n)1/3r(tn;tn)⩽(1+o(1))(48n)1/3 as n→∞.

Keywords

Ramsey number, Mixed Ramsey number

Publication Date

2002

Source Publication Title

Discrete Mathematics

Volume

258

Issue

1-3

Start Page

383

End Page

388

Publisher

Elsevier

Peer Reviewed

1

DOI

10.1016/S0012-365X(02)00540-X

Link to Publisher's Edition

http://dx.doi.org/10.1016/S0012-365X(02)00540-X

ISSN (print)

1872681X

Included in

Mathematics Commons

Share

COinS