Reverse Mathematics and Recursive Graph Theory
β Scribed by William Gasarch; Jeffry L. Hirst
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 511 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
## Abstract We analyze three applications of Ramseyβs Theorem for 4βtuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramseyβs Theorem while the application in lattice t
The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investigated.
Mathematics Of Bioinformatics: Theory, Methods, And Applications Provides A Comprehensive Format For Connecting And Integrating Information Derived From Mathematical Methods And Applying It To The Understanding Of Biological Sequences, Structures, And Networks. Each Chapter Is Divided Into A Number
## Abstract One of the earliest applications of transfinite numbers is in the construction of derived sequences by Cantor [2]. In [6], the existence of derived sequences for countable closed sets is proved in ATR~0~. This existence theorem is an intermediate step in a proof that a statement concern