Some results on (a: b)-choosability

A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a:b)-choosable, and c/d>a/b, then G is not necessarily (c:d)-choosable. Applying probabilistic methods, an upper bound for the kth choice number of a graph is given. We also prove that a directed graph with maximum outdegree d and no odd directed cycle is (k(d+1):k)-choosable for every k>=1. Other results presented in this article are related to the strong choice number of graphs (a generalization of the strong chromatic number). We conclude with complexity analysis of some decision problems related to graph choosability.

[1]  Béla Bollobás,et al.  The chromatic number of random graphs , 1988, Comb..

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Noga Alon,et al.  Colorings and orientations of graphs , 1992, Comb..

[4]  N. Alon,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2004 .

[5]  Roland Häggkvist,et al.  A note on list-colorings , 1989, J. Graph Theory.

[6]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[7]  J. Schiff.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[8]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[11]  Shai Gutner,et al.  Choice numbers of graphs , 2008, ArXiv.

[12]  Noga Alon.  The String Chromatic Number of a Graph , 1992, Random Struct. Algorithms.

[13]  Margit Voigt,et al.  Every 2-choosable graph is (2 m, m )-choosable , 1996 .

[14]  Noga Alon,et al.  Choice Numbers of Graphs: a Probabilistic Approach , 1992, Combinatorics, Probability and Computing.

[15]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[16]  N. Alon.  Restricted colorings of graphs , 1993 .

[17]  Zsolt Tuza,et al.  Graph colorings with local constraints - a survey , 1997, Discuss. Math. Graph Theory.

[18]  Fred Galvin,et al.  The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.

[19]  Zsolt Tuza,et al.  New trends in the theory of graph colorings: Choosability and list coloring , 1997, Contemporary Trends in Discrete Mathematics.

[20]  Mark N. Ellingham,et al.  List edge colourings of some 1-factorable multigraphs , 1996, Comb..

[21]  Michael Stiebitz,et al.  A solution to a colouring problem of P. Erdös , 1992, Discret. Math..

[22]  Shai Gutner,et al.  The complexity of planar graph choosability , 1996, Discret. Math..

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Zsolt Tuza,et al.  Every 2-choosable graph is (2m, m)-choosable , 1996, J. Graph Theory.