Graph Coloring and Reverse Mathematics
暂无分享，去创建一个
Improving a theorem of Gasarch and Hirst, we prove that if 2 ≤ k ≤ m < ω, then the following is equivalent to WKL0 over RCA0: Every locally k-colorable graph is m-colorable. Mathematics Subject Classification: 03F35, 03D45.
[1] Stephen G. Simpson,et al. Subsystems of second order arithmetic , 1999, Perspectives in mathematical logic.
[2] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .
[3] Jeffry L. Hirst,et al. Reverse Mathematics and Recursive Graph Theory , 1998, Math. Log. Q..