Coloring closed Noetherian graphs

2022/03/04 by Zapletal, Jindrich · 1 citation
#03E35 #05C15 #14P99 #Combinatorics (math.CO) #FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.2203.02316

Abstract

If G is a closed Noetherian graph on a sigma-compact Polish space without an infinite clique, it is consistent with the choiceless set theory ZF+DC that G is countably chromatic and there is no Vitali set.

Cited by

• Independence relations in the Solovay model I

Related

• Coloring the distance graphs
• Noetherian spaces in choiceless set theory
• Coloring redundant algebraic hypergraphs
• Triangles and Vitali sets
• Counterexample to Babai's lonely colour conjecture