List packing number of bounded degree graphs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Cambie, Stijn, van Batenburg, Wouter Cames, Davies, Ewan, Kang, Ross J.
Format: Preprint
Publié: 2023
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916487341539328
author Cambie, Stijn
van Batenburg, Wouter Cames
Davies, Ewan
Kang, Ross J.
author_facet Cambie, Stijn
van Batenburg, Wouter Cames
Davies, Ewan
Kang, Ross J.
contents 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 $Δ$ has list packing number at most $Δ+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.
format Preprint
id arxiv_https___arxiv_org_abs_2303_01246
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle List packing number of bounded degree graphs
Cambie, Stijn
van Batenburg, Wouter Cames
Davies, Ewan
Kang, Ross J.
Combinatorics
05C07, 05C15, 05C35, 05C69, 05C70
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 $Δ$ has list packing number at most $Δ+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.
title List packing number of bounded degree graphs
topic Combinatorics
05C07, 05C15, 05C35, 05C69, 05C70
url https://arxiv.org/abs/2303.01246