Strong fractional choice number of series-parallel graphs

2019/10/28 by Xuer Li, Li, Xuer, Xuding Zhu +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1910.12473

openalex publication_date 2019/10/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The strong fractional choice number of a graph G is the infimum of those real numbers r such that G is (\lceil rm \rceil, m)-choosable for every positive integer m. The strong fractional choice number of a family \cal G of graphs is the supremum of the strong fractional choice number of graphs in \cal G. We denote by \calQ_k the class of series-parallel graphs with girth at least k. This paper proves that for k=4q-1, 4q,4q+1, 4q+2, the strong fractional number of \calQ_k is exactly 2+ (1)/(q).

Related

• The strong fractional choice number of 3-choice critical graphs
• Choice numbers of graphs
• On the choice number of complete multipartite graphs with part size four
• Some results on (a:b)-choosability
• Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices