Large Chromatic Number and Ramsey Graphs

被引：4
|
作者：
Biro, Csaba [1 ]
Fueredi, Zoltan [2 ,3 ]
Jahanbekam, Sogol [2 ]
机构：
[1] Univ Louisville, Dept Math, Louisville, KY 40292 USA
[2] Univ Illinois, Dept Math, Urbana, IL 61801 USA
[3] Hungarian Acad Sci, Renyi Inst Math, H-1364 Budapest, Hungary
来源：
GRAPHS AND COMBINATORICS | 2013年 / 29卷 / 05期
基金：
美国国家科学基金会;
关键词：
Clique number; Chromatic number; Ramsey graphs;
D O I：
10.1007/s00373-012-1179-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let Q (n, chi) denote the minimum clique size an n-vertex graph can have if its chromatic number is chi. Using Ramsey graphs we give an exact, albeit implicit, formula for the case chi a parts per thousand yen (n + 3)/2.
引用
收藏
页码：1183 / 1191
页数：9
相关论文
共 50 条
  • [1] Large Chromatic Number and Ramsey Graphs
    Csaba Biró
    Zoltán Füredi
    Sogol Jahanbekam
    Graphs and Combinatorics, 2013, 29 : 1183 - 1191
  • [2] SUBGRAPHS OF LARGE CONNECTIVITY AND CHROMATIC NUMBER IN GRAPHS OF LARGE CHROMATIC NUMBER
    ALON, N
    KLEITMAN, D
    THOMASSEN, C
    SAKS, M
    SEYMOUR, P
    JOURNAL OF GRAPH THEORY, 1987, 11 (03) : 367 - 371
  • [3] Gallai-Ramsey numbers for graphs with chromatic number three
    Zhao, Qinghong
    Wei, Bing
    DISCRETE APPLIED MATHEMATICS, 2021, 304 : 110 - 118
  • [4] Graphs with large distinguishing chromatic number
    Cavers, Michael
    Seyffarth, Karen
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (01):
  • [5] ON THE RAMSEY NUMBER OF TREES VERSUS GRAPHS WITH LARGE CLIQUE NUMBER
    GOULD, RJ
    JACOBSON, MS
    JOURNAL OF GRAPH THEORY, 1983, 7 (01) : 71 - 78
  • [6] INFINITE STABLE GRAPHS WITH LARGE CHROMATIC NUMBER
    Halevi, Yatir
    Kaplan, Itay
    Shelah, Saharon
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2022, 375 (03) : 1767 - 1799
  • [7] ON GRAPHS WITH SMALL SUBGRAPHS OF LARGE CHROMATIC NUMBER
    RODL, V
    DUKE, RA
    GRAPHS AND COMBINATORICS, 1985, 1 (01) : 91 - 96
  • [8] INDUCED SUBTREES IN GRAPHS OF LARGE CHROMATIC NUMBER
    GYARFAS, A
    SZEMEREDI, E
    TUZA, Z
    DISCRETE MATHEMATICS, 1980, 30 (03) : 235 - 244
  • [9] Induced trees in graphs of large chromatic number
    Scott, AD
    JOURNAL OF GRAPH THEORY, 1997, 24 (04) : 297 - 311
  • [10] NEARLY BIPARTITE GRAPHS WITH LARGE CHROMATIC NUMBER
    RODL, V
    COMBINATORICA, 1982, 2 (04) : 377 - 383
12345