List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908634912391168 |
|---|---|
| author | Kaul, Hemanshu Marciaga, Leonardo Mudrock, Jeffrey A. |
| author_facet | Kaul, Hemanshu Marciaga, Leonardo Mudrock, Jeffrey A. |
| contents | We study the list chromatic number of the Cartesian product of a complete graph of order $n$ and a complete bipartite graph with partite sets of size $a$ and $b$, denoted $χ_{\ell}(K_n \square K_{a,b})$. At the 2024 Sparse Graphs Coalition's Workshop on algebraic, extremal, and structural methods and problems in graph colouring, Mudrock presented the following question: For each positive integer $a$, does $χ_{\ell}(K_n \square K_{a,b}) = n+a$ if and only if $b \geq (n+a-1)!^a/(a-1)!^a$? In this paper, we show the answer to this question is yes by studying $χ_{\ell}(H \square K_{a,b})$ when $H$ is strongly chromatic-choosable (a special form of vertex criticality) with the help of the list color function and analytic inequalities such as that of Karamata. Our result can be viewed as a generalization of the well-known result that $χ_{\ell}(K_{a,b}) = 1+a$ if and only if $b \geq a^a$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_16733 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph Kaul, Hemanshu Marciaga, Leonardo Mudrock, Jeffrey A. Combinatorics 05C15 We study the list chromatic number of the Cartesian product of a complete graph of order $n$ and a complete bipartite graph with partite sets of size $a$ and $b$, denoted $χ_{\ell}(K_n \square K_{a,b})$. At the 2024 Sparse Graphs Coalition's Workshop on algebraic, extremal, and structural methods and problems in graph colouring, Mudrock presented the following question: For each positive integer $a$, does $χ_{\ell}(K_n \square K_{a,b}) = n+a$ if and only if $b \geq (n+a-1)!^a/(a-1)!^a$? In this paper, we show the answer to this question is yes by studying $χ_{\ell}(H \square K_{a,b})$ when $H$ is strongly chromatic-choosable (a special form of vertex criticality) with the help of the list color function and analytic inequalities such as that of Karamata. Our result can be viewed as a generalization of the well-known result that $χ_{\ell}(K_{a,b}) = 1+a$ if and only if $b \geq a^a$. |
| title | List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph |
| topic | Combinatorics 05C15 |
| url | https://arxiv.org/abs/2509.16733 |