Reverse Mathematics and Recursive Graph Theory
William Gasarch, Jeffry Hirst
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.
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf