Reverse mathematics and infinite traceable graphs
We analyze three applications of Ramseys Theorem for 4-tuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramseys Theorem while the application in lattice theory is shown to be provable in the weaker system RCA0.
reverse mathematics traceable graphs effective combinatorics lattice theory. msc (2010) 03b30 03d80 05c63