Reverse Mathematics and Recursive Graph Theory
classification
🧮 math.LO
keywords
resultscombinatoricsgraphsmathematicspathsrecursivereversebounded
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.