Triangle-free intersection graphs of line segments with large chromatic number

被引：54

作者：

Pawlik, Arkadiusz ^{[1
]}

Kozik, Jakub ^{[1
]}

Krawczyk, Tomasz ^{[1
]}

Lason, Michal ^{[1
,2
]}

Micek, Piotr ^{[1
]}

Trotter, William T. ^{[3
]}

Walczak, Bartosz ^{[1
,4
]}

机构：

[1] Jagiellonian Univ, Fac Math & Comp Sci, Theoret Comp Sci Dept, Krakow, Poland

[2] Polish Acad Sci, Inst Math, Warsaw, Poland

[3] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA

[4] Ecole Polytech Fed Lausanne, CH-1015 Lausanne, Switzerland

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2014年 / 105卷

关键词：

Intersection graph; Line segments; Triangle-free; Chromatic number; ARCWISE CONNECTED SETS; PLANE; INTERVALS; RELATIVES;

D O I：

10.1016/j.jctb.2013.11.001

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In the 1970s Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer k we construct a triangle-free family of line segments in the plane with chromatic number greater than k. Our construction disproves a conjecture of Scott that graphs excluding induced subdivisions of any fixed graph have chromatic number bounded by a function of their clique number. (C) 2013 Elsevier Inc. All rights reserved.

引用

页码：6 / 10

页数：5

共 50 条

[41] Triangle-free graphs with the maximum number of cycles
Arman, Andrii
Gunderson, David S.
Tsaturian, Sergei
DISCRETE MATHEMATICS, 2016, 339 (02) : 699 - 711
[42] A NOTE ON THE INDEPENDENCE NUMBER OF TRIANGLE-FREE GRAPHS
SHEARER, JB
DISCRETE MATHEMATICS, 1983, 46 (01) : 83 - 87
[43] The independence number of circulant triangle-free graphs
Ayat, S. Masih
Ayat, S. Majid
Ghahramani, Meysam
AIMS MATHEMATICS, 2020, 5 (04): : 3741 - 3750
[44] On the cycle isolation number of triangle-free graphs
Zhang, Gang
Wu, Baoyindureng
DISCRETE MATHEMATICS, 2024, 347 (12)
[45] ISOMORPHISM OF 2 INFINITE-CHROMATIC TRIANGLE-FREE GRAPHS
TUZA, Z
DISCRETE MATHEMATICS, 1988, 69 (01) : 95 - 95
[46] Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
Broersma, Hajo
Golovach, Petr A.
Paulusma, Daniel
Song, Jian
THEORETICAL COMPUTER SCIENCE, 2012, 423 : 1 - 10
[47] Triangle-free planar graphs with small independence number
Dvorak, Zdenek
Venters, Jordan
EUROPEAN JOURNAL OF COMBINATORICS, 2019, 76 : 88 - 103
[48] Triangle-free planar graphs with the smallest independence number
Dvorak, Zdenek
Masarik, Tomas
Musilek, Jan
Pangrac, Ondrej
JOURNAL OF GRAPH THEORY, 2019, 90 (03) : 443 - 454
[49] THE NUMBER OF MAXIMAL INDEPENDENT SETS IN TRIANGLE-FREE GRAPHS
HUJTER, M
TUZA, Z
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (02) : 284 - 288
[50] The independent domination number of maximal triangle-free graphs
Wang, Changping
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 42 : 129 - 136

← 1 2 3 4 5 →