Triangle-free graphs with large chromatic numbers

被引：11
|
作者：
Nilli, A [1 ]
机构：
[1] Tel Aviv Univ, Dept Math, IL-69978 Ramat Aviv, Tel Aviv, Israel
来源：
DISCRETE MATHEMATICS | 2000年 / 211卷 / 1-3期
关键词：
chromatic number; triangle-free graphs;
D O I：
10.1016/S0012-365X(99)00109-0
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
It is shown that there are two positive constants c(1),c(2) such that the maximum possible chromatic number of a triangle-free graph with m > 1 edges is at most c(1)m(1/3)/(log m)(2/3) and at least c(2)m(1/3) /(log m)(2/3). This is deduced from results of Ajtai, Komlos, Szemeredi, Kim and Johansson, and settles a problem of Erdos. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：261 / 262
页数：2
相关论文
共 50 条
  • [31] LARGE INDEPENDENT SETS IN TRIANGLE-FREE PLANAR GRAPHS
    Dvorak, Zdenek
    Mnich, Matthias
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (02) : 1355 - 1373
  • [32] Triangle-free graphs with large independent domination number
    Shiu, Wai Chee
    Chen, Xue-gang
    Chan, Wai Hong
    [J]. DISCRETE OPTIMIZATION, 2010, 7 (1-2) : 86 - 92
  • [33] Large induced forests in triangle-free planar graphs
    Salavatipour, MR
    [J]. GRAPHS AND COMBINATORICS, 2006, 22 (01) : 113 - 126
  • [34] Large Independent Sets in Triangle-Free Planar Graphs
    Dvorak, Zdenek
    Mnich, Matthias
    [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 346 - 357
  • [35] On-line 3-chromatic graphs -: I.: Triangle-free graphs
    Gyárfás, A
    Király, Z
    Lehel, J
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (03) : 385 - 411
  • [36] On the structure of triangle-free graphs of large minimum degree
    Luczak, Tomasz
    [J]. COMBINATORICA, 2006, 26 (04) : 489 - 493
  • [37] Large Induced Forests in Triangle-Free Planar Graphs
    Mohammad R. Salavatipour
    [J]. Graphs and Combinatorics, 2006, 22 : 113 - 126
  • [38] Median graphs and triangle-free graphs
    Imrich, W
    Klavzar, S
    Mulder, HM
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (01) : 111 - 118
  • [39] Triangle-free equimatchable graphs
    Buyukcolak, Yasemin
    Ozkan, Sibel
    Gozupek, Didem
    [J]. JOURNAL OF GRAPH THEORY, 2022, 99 (03) : 461 - 484
  • [40] Large Cuts with Local Algorithms on Triangle-Free Graphs
    Hirvonen, Juho
    Rybicki, Joel
    Schmid, Stefan
    Suomela, Jukka
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (04):
12345