Triangle-free graphs with large chromatic number and no induced wheel

被引：1
|
作者：
Davies, James [1 ]
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
来源：
JOURNAL OF GRAPH THEORY | 2023年 / 103卷 / 01期
关键词：
Burling graphs; chromatic number; induced subgraph; wheels; INTERSECTION GRAPHS;
D O I：
10.1002/jgt.22906
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A wheel is a graph consisting of an induced cycle of length at least four and a single additional vertex with at least three neighbours on the cycle. We prove that no Burling graph contains an induced wheel. Burling graphs are triangle-free and have arbitrarily large chromatic number, so this answers a question of Trotignon and disproves a conjecture of Scott and Seymour.
引用
收藏
页码：112 / 118
页数：7
相关论文
共 50 条
  • [31] ON THE HULL NUMBER OF TRIANGLE-FREE GRAPHS
    Dourado, Mitre C.
    Protti, Fabio
    Rautenbach, Dieter
    Szwarcfiter, Jayme L.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 23 (04) : 2163 - 2172
  • [32] MINIMAL 5-CHROMATIC TRIANGLE-FREE GRAPHS
    AVIS, D
    JOURNAL OF GRAPH THEORY, 1979, 3 (04) : 397 - 400
  • [33] On minimal triangle-free 6-chromatic graphs
    Goedgebeur, Jan
    JOURNAL OF GRAPH THEORY, 2020, 93 (01) : 34 - 48
  • [34] Subcubic triangle-free graphs have fractional chromatic number at most 14/5
    Dvorak, Z.
    Sereni, J. -S.
    Volec, J.
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2014, 89 : 641 - 662
  • [35] On the chromatic number of simple triangle-free triple systems
    Frieze, Alan
    Mubayi, Dhruv
    ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
  • [36] A triangle-free circle graph with chromatic number 5
    Ageev, AA
    DISCRETE MATHEMATICS, 1996, 152 (1-3) : 295 - 298
  • [37] Triangle-free graphs with the maximum number of cycles
    Arman, Andrii
    Gunderson, David S.
    Tsaturian, Sergei
    DISCRETE MATHEMATICS, 2016, 339 (02) : 699 - 711
  • [38] A NOTE ON THE INDEPENDENCE NUMBER OF TRIANGLE-FREE GRAPHS
    SHEARER, JB
    DISCRETE MATHEMATICS, 1983, 46 (01) : 83 - 87
  • [39] The independence number of circulant triangle-free graphs
    Ayat, S. Masih
    Ayat, S. Majid
    Ghahramani, Meysam
    AIMS MATHEMATICS, 2020, 5 (04): : 3741 - 3750
  • [40] Induced trees in triangle-free graphs
    Matousek, Jiri
    Samal, Robert
    ELECTRONIC JOURNAL OF COMBINATORICS, 2008, 15 (01):
12345