Semialgebraic graphs having countable list-chromatic numbers

DOI10.1090/PROC/12832MaRDI QIDQ2790252zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: The set of semialgebraic graphs having countable list-chromatic numbers is characterized. Some other related sets of graphs having countable list-chromatic numbers also are.

Recommendations

• The list-chromatic number of infinite graphs defined on Euclidean spaces
• GRAPHS ON EUCLIDEAN SPACES DEFINED USING TRANSCENDENTAL DISTANCES
• The list-chromatic number of infinite graphs
• Coloring of n-dimensional distance graphs
• Distance graphs whose chromatic number is affected by the underlying set theory

Cites work

• A Decomposition Theorem for R n
• A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids
• Colorings and orientations of graphs
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 866028 (Why is no real title available?)
• scientific article; zbMATH DE number 866055 (Why is no real title available?)
• scientific article; zbMATH DE number 866056 (Why is no real title available?)
• On chromatic number of graphs and set-systems
• The list-chromatic number of infinite graphs
• The list-chromatic number of infinite graphs defined on Euclidean spaces
• The Mathematical Coloring Book
• What must and what need not be contained in a graph of uncountable chromatic number?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790252)