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 条

[21] Radius three trees in graphs with large chromatic number
Kierstead, HA
Zhu, YX
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2004, 17 (04) : 571 - 581
[22] GRAPHS WITH LARGE GIRTH AND CHROMATIC NUMBER ARE HARD FOR NULLSTELLENSATZ
Romero, Julian
Tuncel, Levent
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (03) : 2108 - 2131
[23] LIST EDGE CHROMATIC NUMBER OF GRAPHS WITH LARGE GIRTH
KOSTOCHKA, AV
DISCRETE MATHEMATICS, 1992, 101 (1-3) : 189 - 201
[24] On embedding of finite distance graphs with large chromatic number in random graphs
Nagaeva S.V.
Raigorodskii A.M.
Journal of Mathematical Sciences, 2009, 161 (5) : 648 - 667
[25] Embeddability of finite distance graphs with a large chromatic number in random graphs
Nagaeva, S. V.
DOKLADY MATHEMATICS, 2008, 77 (01) : 13 - 16
[26] Embeddability of finite distance graphs with a large chromatic number in random graphs
Department of Mathematical Statistics and Random Processes, Faculty of Mechanics and Mathematics, Moscow State University, Leninskie gory, Moscow 119992, Russia
Dokl. Math., 2008, 1 (13-16):
[27] The chromatic Ramsey number of odd wheels
Paul, Nathalie
Tardif, Claude
JOURNAL OF GRAPH THEORY, 2012, 69 (02) : 198 - 205
[28] Chromatic Ramsey number of acyclic hypergraphs
Gyarfas, Andras
Riasanovsky, Alexander W. N.
Sherman-Bennett, Melissa U.
DISCRETE MATHEMATICS, 2017, 340 (03) : 373 - 378
[29] On the chromatic number of graphs
Butenko, S
Festa, P
Pardalos, PM
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2001, 109 (01) : 51 - 67
[30] On the Chromatic Number of Graphs
S. Butenko
P. Festa
P. M. Pardalos
Journal of Optimization Theory and Applications, 2001, 109 (1) : 69 - 83

← 1 2 3 4 5 →