Graph Coloring and Reverse Mathematics

  title={Graph Coloring and Reverse Mathematics},
  author={James H. Schmerl},
  journal={Math. Log. Q.},
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. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
1 Extracted Citations
3 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-3 of 3 references

A colour problem for infinite graphs and a problem in the theory of relations

  • P. Erdös, N. G. de Bruijn
  • Indag. Math
  • 1951
2 Excerpts

Similar Papers

Loading similar papers…