On pattern Ramsey numbers of graphs

被引:11
|
作者
Jamison, RE [1 ]
West, DB
机构
[1] Clemson Univ, Clemson, SC 29634 USA
[2] Univ Illinois, Dept Math, Urbana, IL 61801 USA
关键词
D O I
10.1007/s00373-004-0562-y
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A color pattern is a graph whose edges are partitioned into color classes. A family F of color patterns is a Ramsey family if there is some integer N such that every edge-coloring of K-N has a copy of some pattern in F. The smallest such N is the (pattern) Ramsey number R(F) of F. The classical Canonical Ramsey Theorem of Erdos and Rado [4] yields an easy characterization of the Ramsey families of color patterns. In this paper we determine R(F) for all families consisting of equipartitioned stars, and we prove that 5[s-1/2] + 1 less than or equal to R(F) less than or equal to 3s - root3s when F consists of a monochromatic star of size s and a polychromatic triangle.
引用
收藏
页码:333 / 339
页数:7
相关论文
共 50 条
  • [1] On Pattern Ramsey Numbers of Graphs
    Robert E. Jamison
    Douglas B. West
    [J]. Graphs and Combinatorics, 2004, 20 : 333 - 339
  • [2] COMPLEMENTARY RAMSEY NUMBERS AND RAMSEY GRAPHS
    Munemasa, Akihiro
    Shinohara, Masashi
    [J]. JOURNAL OF THE INDONESIAN MATHEMATICAL SOCIETY, 2019, 25 (02) : 146 - 153
  • [3] On graphs with linear Ramsey numbers
    Graham, RL
    Rödl, V
    Rucinski, A
    [J]. JOURNAL OF GRAPH THEORY, 2000, 35 (03) : 176 - 192
  • [4] ON IRREDUNDANT RAMSEY NUMBERS FOR GRAPHS
    HATTINGH, JH
    [J]. JOURNAL OF GRAPH THEORY, 1990, 14 (04) : 437 - 441
  • [5] Ramsey numbers in octahedron graphs
    Harborth, H
    Mengersen, I
    [J]. DISCRETE MATHEMATICS, 2001, 231 (1-3) : 241 - 246
  • [6] LOWER RAMSEY NUMBERS FOR GRAPHS
    MYNHARDT, CM
    [J]. DISCRETE MATHEMATICS, 1991, 91 (01) : 69 - 75
  • [7] Ramsey numbers of ordered graphs
    Balko, Martin
    Cibulka, Josef
    Kral, Karel
    Kyncl, Jan
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (01):
  • [8] Constrained Ramsey numbers of graphs
    Jamison, RE
    Jiang, T
    Ling, ACH
    [J]. JOURNAL OF GRAPH THEORY, 2003, 42 (01) : 1 - 16
  • [9] Degree Ramsey Numbers of Graphs
    Kinnersley, William B.
    Milans, Kevin G.
    West, Douglas B.
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (1-2): : 229 - 253
  • [10] On Ramsey numbers of sparse graphs
    Kostochka, A
    Sudakov, B
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2003, 12 (5-6): : 627 - 641