Mathematical Logic Quarterly 44 (4):465-473 (1998)

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
Keywords Graph theory  Recursion theory  Proof theory  Reverse mathematics
Categories (categorize this paper)
DOI 10.1002/malq.19980440405
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,355
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Recursive Coloration of Countable Graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.

Add more references

Citations of this work BETA

Domatic Partitions of Computable Graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Reverse Mathematics and the Coloring Number of Graphs.Matthew Jura - 2016 - Notre Dame Journal of Formal Logic 57 (1):27-44.

Add more citations

Similar books and articles


Added to PP index

Total views
27 ( #425,636 of 2,519,631 )

Recent downloads (6 months)
1 ( #406,756 of 2,519,631 )

How can I increase my downloads?


My notes