Semialgebraic graphs having countable list-chromatic numbers

DOI10.1090/proc/12832zbMath1331.05085arXiv1405.4814OpenAlexW1492710237MaRDI QIDQ2790252

James H. Schmerl

Publication date: 3 March 2016

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.4814

zbMATH Keywords

\( \sigma \)-semialgebraic graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The list-chromatic number of infinite graphs
• The list-chromatic number of infinite graphs defined on Euclidean spaces
• What must and what need not be contained in a graph of uncountable chromatic number?
• Colorings and orientations of graphs
• The Mathematical Coloring Book
• A Decomposition Theorem for R n
• A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids
• On chromatic number of graphs and set-systems

This page was built for publication: Semialgebraic graphs having countable list-chromatic numbers