Abstract
We investigate the list-chromatic number of infinite graphs. It is easy to see that Chr(X) ≤ List(X) ≤ Col(X) for each graph X. It is consistent that List(X) = Col(X) holds for every graph with Col(X) infinite. It is also consistent that for graphs of cardinality ℵ 1, List(X) is countable iff Chr(X) is countable.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
U. Abraham, Proper forcing, in Handbook of Set Theory (M. Foreman and A Kanamori, eds.), Springer, Berlin, 2010, pp. 332–394.
N. Alon, Restricted colourings of graphs, in Surveys in Combinatorics, Proc. 14th British Comb. Conf., Cambridge University Press, Cambridge, 1993, pp. 1–33.
H. Ardal, J. Maňuch, M. Rosenfeld, S. Shelah and L. Stacho, The odd-distance plane graph, Discrete and Computational Geometry 42 (2009), 132–141.
J. E. Baumgartner and R. Laver, Iterated perfect-set forcing, Annals of Mathematical Logic 17 (1979), 271–288.
P. Erdős, Problems and results in chromatic number theory, in Proof Techniques in Graph Theory, (F. Harary, ed.), Academic Press, New York, 1969, pp. 47–55.
P. Erdős and A. Hajnal, On chromatic number of graphs and set systems, Acta Mathematica Academiae Scientiarum Hungaricae 17 (1966), 61–99.
P. Erdős, A. L. Rubin and H. Taylor, Choosability in graphs, in Proc. West Coast Conf. on Combinatorics, Graph Theory, and Computing, Congressus Numerantium 26 (1979), 125–157.
D. H. Fremlin, Consequences of Martin’s axiom, Cambridge University Press, Cambridge, 1984.
A. Hajnal and A. Máté, Set mappings, partitions, and chromatic numbers, in Logic Colloquium’ 73, (Bristol 1973), Studies in Logic and the Foundations of Mathematics, Vol. 80, North-Holland, Amsterdam, 1975, pp. 347–379.
J. D. Halpern and P. E. Howard, Cardinal addition and the axiom of choice, American Mathematical Society. Bulletin 80 (1974), 584–586.
J. D. Halpern and P. E. Howard, The law of infinite cardinal addition is weaker than the axiom of choice, Transactions of the American Mathematical Society 220 (1976), 195–204.
J. Hamkins, Fragile measurability, The Journal of Symbolic Logic 59 (1994), 262–282.
M. Kojman, Shelah’s revised GCH and a question of Alon, to appear.
P. Komjáth, The colouring number, Proceedings of the London Mathematical Society 54 (1987), 1–14.
P. Komjáth, The list-chromatic number of infinite graphs defined on Euclidean spaces, Discrete and Computational Geometry 45 (2011), 497–502.
K. Kunen, Set Theory. An Introduction to Independence Proofs, Studies in Logic and the Foundations of Mathematics, Vol. 102, North-Holland, Amsterdam, 1980.
J. H. Schmerl, The list-chromatic number of Euclidean space, Geombinatorics 5 (1995), 65–68.
S. Shelah, A compactness theorem in singular cardinals, free algebras, Whitehead problems, and transversals, Israel Journal of Mathematics 21 (1975), 319–349.
S. Shelah, Proper and Improper Forcing, Springer, Berlin, 1998.
V. G. Vizing, Vertex colorings with given colors, Diskretnyĭ Analiz 29 (1976), 3–10.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research partially supported by Hungarian National Research Grant K 81121.
Rights and permissions
About this article
Cite this article
Komjáth, P. The list-chromatic number of infinite graphs. Isr. J. Math. 196, 67–94 (2013). https://doi.org/10.1007/s11856-012-0145-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-012-0145-6