Reverse Mathematics and Recursive Graph Theory

Simple item page
dc.creatorGasarch, William
dc.creatorHirst, Jeffry
dc.date1994-04-22
dc.date.accessioned2026-07-07T09:15:05Z
dc.date.available2026-07-07T09:15:05Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/9404206
dc.identifierhttp://arxiv.org/abs/math/9404206
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152902
dc.subjectLogic
dc.titleReverse Mathematics and Recursive Graph Theory
dc.typetext

Files

Collections

arXiv