DIAGONAL RAMSEY NUMBERS FOR SMALL GRAPHS

被引：0

作者：

BURR, SA ^{[1
]}

机构：

[1] BELL TEL LABS INC,WHIPPANY,NJ 07981

来源：

NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY | 1973年 / 20卷 / 01期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：A46 / A46

页数：1

共 50 条

[31] LOWER RAMSEY NUMBERS FOR GRAPHS
MYNHARDT, CM
DISCRETE MATHEMATICS, 1991, 91 (01) : 69 - 75
[32] Ramsey numbers in octahedron graphs
Harborth, H
Mengersen, I
DISCRETE MATHEMATICS, 2001, 231 (1-3) : 241 - 246
[33] Constrained Ramsey numbers of graphs
Jamison, RE
Jiang, T
Ling, ACH
JOURNAL OF GRAPH THEORY, 2003, 42 (01) : 1 - 16
[34] Degree Ramsey Numbers of Graphs
Kinnersley, William B.
Milans, Kevin G.
West, Douglas B.
COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (1-2): : 229 - 253
[35] Ramsey numbers of ordered graphs
Balko, Martin
Cibulka, Josef
Kral, Karel
Kyncl, Jan
ELECTRONIC JOURNAL OF COMBINATORICS, 2020, 27 (01):
[36] ON IRREDUNDANT RAMSEY NUMBERS FOR GRAPHS
HATTINGH, JH
JOURNAL OF GRAPH THEORY, 1990, 14 (04) : 437 - 441
[37] On Ramsey numbers of sparse graphs
Kostochka, A
Sudakov, B
COMBINATORICS PROBABILITY & COMPUTING, 2003, 12 (5-6): : 627 - 641
[38] Ramsey numbers for sparse graphs
Eaton, N
DISCRETE MATHEMATICS, 1998, 185 (1-3) : 63 - 75
[39] On Pattern Ramsey Numbers of Graphs
Robert E. Jamison
Douglas B. West
Graphs and Combinatorics, 2004, 20 : 333 - 339
[40] Ramsey numbers and the size of graphs
Sudakov, Benny
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (04) : 980 - 986