The list-chromatic number and the coloring number of uncountable graphs
- 3 June 2023
- journal article
- research article
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 259 (1) , 1-39
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- The chromatic number of infinite graphs — A surveyDiscrete Mathematics, 2011
- Openly generated Boolean algebras and the Fodor-type reflection principleFundamenta Mathematicae, 2011
- Fodor-type Reflection Principle and reflection of metrizability and meta-LindelöfnessTopology and its Applications, 2010
- DiamondsProceedings of the American Mathematical Society, 2010
- Generic compactness reformulatedArchive for Mathematical Logic, 2004
- Locally nice spaces and Axiom RTopology and its Applications, 2002
- Left separated spaces with point-countable basesTransactions of the American Mathematical Society, 1986
- On a Conjecture of R. RadoJournal of the London Mathematical Society, 1983
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and tranversalsIsrael Journal of Mathematics, 1975
- On chromatic number of graphs and set-systemsActa Mathematica Hungarica, 1966