List packing number of bounded degree graphs

被引：0
|
作者：
Cambie, Stijn [1 ,2 ]
van Batenburg, Wouter Cames [3 ]
Davies, Ewan [4 ]
Kang, Ross J. [5 ]
机构：
[1] Inst Basic Sci IBS, Extremal Combinator & Probabil Grp ECOPRO, Daejeon, South Korea
[2] Katholieke Univ Leuven, Dept Comp Sci, Campus Kulak Kortrijk, B-8500 Kortrijk, Belgium
[3] Delft Univ Technol, Delft Inst Appl Math, Delft, Netherlands
[4] Colorado State Univ, Dept Comp Sci, Ft Collins, CO USA
[5] Univ Amsterdam, Korteweg de Vries Inst Math, Amsterdam, Netherlands
来源：
COMBINATORICS PROBABILITY AND COMPUTING | 2024年
关键词：
Packing of list colourings; list packing number; list colouring; correspondence colouring; maximum degree; transversals;
D O I：
10.1017/S0963548324000191
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We investigate the list packing number of a graph, the least $k$ such that there are always $k$ disjoint proper list-colourings whenever we have lists all of size $k$ associated to the vertices. We are curious how the behaviour of the list packing number contrasts with that of the list chromatic number, particularly in the context of bounded degree graphs. The main question we pursue is whether every graph with maximum degree $\Delta$ has list packing number at most $\Delta +1$ . Our results highlight the subtleties of list packing and the barriers to, for example, pursuing a Brooks'-type theorem for the list packing number.
引用
下载
收藏
页数：22
相关论文
共 50 条
  • [21] Equitable and List Equitable Colorings of Graphs with Bounded Maximum Average Degree
    Dong, Aijun
    Zou, Qingsong
    Li, Guojun
    ARS COMBINATORIA, 2016, 124 : 303 - 311
  • [22] The stable set problem in graphs with bounded genus and bounded odd cycle packing number
    Conforti, Michele
    Fiorini, Samuel
    Huynh, Tony
    Joret, Gwenael
    Weltge, Stefan
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2896 - 2915
  • [23] Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number
    Chakraborty, Sankardeep
    Jo, Seungbum
    DCC 2022: 2022 DATA COMPRESSION CONFERENCE (DCC), 2022, : 103 - 112
  • [24] The chromatic number of signed graphs with bounded maximum average degree
    Jacques, Fabien
    Pinlou, Alexandre
    DISCRETE APPLIED MATHEMATICS, 2022, 316 : 43 - 59
  • [25] On the asymptotics of degree structure of configuration graphs with bounded number of edges
    Pavlov, Yurii L.
    Cheplyukova, Irina A.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2019, 29 (04): : 219 - 232
  • [26] The size Ramsey number of short subdivisions of bounded degree graphs
    Kohayakawa, Yoshiharu
    Retter, Troy
    Rodl, Vojtech
    RANDOM STRUCTURES & ALGORITHMS, 2019, 54 (02) : 304 - 339
  • [27] Packing Graphs of Bounded Codegree
    Van Batenburg, Wouter Cames
    Kang, Ross J.
    COMBINATORICS PROBABILITY & COMPUTING, 2018, 27 (05): : 725 - 740
  • [28] Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
    Bonamy, Marthe
    Bonnet, Édouard
    Déprés, Hugues
    Esperet, Louis
    Geniet, Colin
    Hilaire, Claire
    Thomassé, Stéphan
    Wesolek, Alexandra
    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2023, 2023-January : 3006 - 3028
  • [29] Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
    Bonamy, Marthe
    Bonnet, Edouard
    Depres, Hugues
    Esperet, Louis
    Geniet, Colin
    Hilaire, Claire
    Thomasse, Stephan
    Wesolek, Alexandra
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 167 : 215 - 249
  • [30] Maximizing the density of Kt's in graphs of bounded degree and clique number
    Kirsch, R.
    Radcliffe, A. J.
    DISCRETE MATHEMATICS, 2020, 343 (06)
12345