The list-chromatic number of infinite graphs
From MaRDI portal
Publication:375873
DOI10.1007/S11856-012-0145-6zbMATH Open1275.05039OpenAlexW2129846869MaRDI QIDQ375873FDOQ375873
Publication date: 1 November 2013
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11856-012-0145-6
Recommendations
Cites Work
- Set theory. An introduction to independence proofs
- Cardinal addition and the axiom of choice
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
- Title not available (Why is that?)
- Title not available (Why is that?)
- On chromatic number of graphs and set-systems
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
- Proper Forcing
- Title not available (Why is that?)
- Fragile measurability
- The odd-distance plane graph
- The Colouring Number
- Iterated perfect-set forcing
- The Law of Infinite Cardinal Addition is Weaker than the Axiom of Choice
- Title not available (Why is that?)
- The list-chromatic number of infinite graphs defined on Euclidean spaces
Cited In (10)
- Lower bounds on coloring numbers from hardness hypotheses in pcf theory
- The chromatic number of infinite graphs - A survey
- Cardinal invariants of closed graphs
- List-compactness of infinite directed graphs
- List edge chromatic number of graphs with large girth
- Semialgebraic graphs having countable list-chromatic numbers
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
- Infinite friendship graphs with infinite parameters
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- Infinitely connected subgraphs in graphs of uncountable chromatic number
This page was built for publication: The list-chromatic number of infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375873)
