Graph colorings and the axiom of choice

DOI10.1007/BF02309111zbMath0748.05056OpenAlexW2014702546WikidataQ114693577 ScholiaQ114693577MaRDI QIDQ1183089

Fred Galvin, Péter Komjáth

Publication date: 28 June 1992

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02309111

zbMATH Keywords

chromatic numberaxiom of choicegraph coloringsirreducible good colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Axiom of choice and related propositions (03E25)

Related Items (7)

The role of the Axiom of Choice in proper and distinguishing colourings ⋮ Zero-divisor graphs and total coloring conjecture ⋮ Same graph, different universe ⋮ On the comparability of cardinals in the absence of the axiom of choice ⋮ Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC ⋮ An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem ⋮ The chromatic number of infinite graphs - A survey

Cites Work

• Equivalents of the axiom of choice. 2nd ed
• Unnamed Item

This page was built for publication: Graph colorings and the axiom of choice