On the Number of Connected Sets in Bounded Degree Graphs

被引：4

作者：

Kangas, Kustaa ^{[1
]}

Kaski, Petteri ^{[2
]}

Koivisto, Mikko ^{[1
]}

Korhonen, Janne H. ^{[1
]}

机构：

[1] Univ Helsinki, Dept Comp Sci, HIIT, POB 68, Helsinki 00014, Finland

[2] Aalto Univ, HIIT, Dept Informat & Comp Sci, POB 15400, Aalto 00076, Finland

来源：

GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2014年 / 8747卷

基金：

芬兰科学院; 欧盟地平线“2020”; 欧洲研究理事会;

关键词：

INDEPENDENT SETS;

D O I：

10.1007/978-3-319-12340-0_28

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A set of vertices in a graph is connected if the set induces a connected subgraph. Using Shearer's entropy lemma, we show that the number of connected sets in an n-vertex graph with maximum vertex degree d is O(1.9351(n)) for d = 3, O(1.9812(n)) for d = 4, and O(1.9940(n)) for d = 5. Dually, we construct infinite families of generalized ladder graphs whose number of connected sets is bounded from below by Omega(1.5537(n)) for d = 3, Omega(1.6180(n)) for d = 4, and Omega(1.7320(n)) for d = 5.

引用

页码：336 / 347

页数：12

共 50 条

[1] On the number of connected sets in bounded degree graphs
Kangas, Kustaa
Kaski, Petteri
Korhonen, Janne H.
Koivisto, Mikko
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (04):
[2] The number and average size of connected sets in graphs with degree constraints
Haslegrave, John
JOURNAL OF GRAPH THEORY, 2022, 100 (03) : 530 - 542
[3] The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
Guruswami, Venkatesan
Sinop, Ali Kemal
PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1615 - 1626
[4] THE DEGREE SETS OF CONNECTED INFINITE-GRAPHS
HARARY, F
HARZHEIM, E
FUNDAMENTA MATHEMATICAE, 1983, 118 (03) : 233 - 236
[5] List packing number of bounded degree graphs
Cambie, Stijn
van Batenburg, Wouter Cames
Davies, Ewan
Kang, Ross J.
COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (06) : 807 - 828
[6] The harmonious chromatic number of bounded degree graphs
Edwards, K
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1997, 55 : 435 - 447
[7] On the Number of Hamilton Cycles in Bounded Degree Graphs
Gebauer, Heidi
PROCEEDINGS OF THE TENTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FIFTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2008, : 241 - 248
[8] Total interval number for graphs with bounded degree
Kostochka, AV
West, DB
JOURNAL OF GRAPH THEORY, 1997, 25 (01) : 79 - 84
[9] Planar Graphs of Bounded Degree Have Bounded Queue Number
Bekos, Michael
Foerster, Henry
Gronemann, Martin
Mchedlidze, Tamara
Montecchiani, Fabrizio
Raftopoulou, Chrysanthi
Ueckerdt, Torsten
PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 176 - 184
[10] PLANAR GRAPHS OF BOUNDED DEGREE HAVE BOUNDED QUEUE NUMBER
Bekos, Michael A.
Foerster, Henry
Gronemann, Martin
Mchedlidze, Tamara
Montecchiani, Fabrizio
Raftopoulou, Chrysanthi
Ueckerdt, Torsten
SIAM JOURNAL ON COMPUTING, 2019, 48 (05) : 1487 - 1502

← 1 2 3 4 5 →