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
基金
美国国家科学基金会;
关键词
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 条
  • [31] Minimum Clique Number, Chromatic Number, and Ramsey Numbers
    Liu, Gaku
    ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (01):
  • [32] CHROMATIC RAMSEY NUMBERS OF GENERALISED MYCIELSKI GRAPHS
    Tardif, Claude
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2024, 44 (04) : 1327 - 1339
  • [33] The Ramsey number of dense graphs
    Conlon, David
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2013, 45 : 483 - 496
  • [34] Cycles in triangle-free graphs of large chromatic number
    Alexandr Kostochka
    Benny Sudakov
    Jacques Verstraëte
    Combinatorica, 2017, 37 : 481 - 494
  • [35] On graphs with a large chromatic number that contain no small odd cycles
    Berlov S.L.
    Bogdanov I.I.
    Journal of Mathematical Sciences, 2012, 184 (5) : 573 - 578
  • [36] THE TOTAL CHROMATIC NUMBER OF GRAPHS HAVING LARGE MAXIMUM DEGREE
    HILTON, AJW
    HIND, HR
    DISCRETE MATHEMATICS, 1993, 117 (1-3) : 127 - 140
  • [37] Cycles in triangle-free graphs of large chromatic number
    Kostochka, Alexandr
    Sudakov, Benny
    Verstraete, Jacques
    COMBINATORICA, 2017, 37 (03) : 481 - 494
  • [38] Perfect graphs of arbitrarily large clique-chromatic number
    Charbit, Pierre
    Penev, Irena
    Thomasse, Stephan
    Trotignon, Nicolas
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 116 : 456 - 464
  • [39] ALGEBRAIC STRUCTURE OF CHROMATIC GRAPHS ASSOCIATED WITH RAMSEY NUMBER N(3,3,3)
    WHITEHEA.EG
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 17 (07): : 1042 - &
  • [40] Graphs whose circular chromatic number equals the chromatic number
    Zhu, XD
    COMBINATORICA, 1999, 19 (01) : 139 - 149