Reverse Mathematics and Recursive Graph Theory

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs, Euler paths, and Hamilton paths. Reverse mathematics provides powerful techniques for analyzing the logical content of theorems. By contrast, recursive mathematics analyzes the effective content of theorems. Theorems and techniques of recursive mathematics can often inspire related results in reverse mathematics, as demonstrated by the research presented here. Sections 1 and 2 analyze theorems on graph colorings. Section 3 considers graphs with Euler paths. Stronger axiom systems are introduced and applied to the study of Hamilton paths in Section 4. We assume familiarity with the methods of reverse mathematics, as described in [15]. Additional information, including techniques for encoding mathematical statements in second-order arithmetic, can be...

• Type: Journal
• Year: 1998
• Where: MLQ
• Authors: William I. Gasarch, Jeffry L. Hirst
• Keywords: Euler Paths, Mathematics, MLQ 1998, Theorems