✦ LIBER ✦

Connected components of graphs and reverse mathematics

✍ Scribed by Jeffry L. Hirst

Publisher: Springer
Year: 1992
Tongue: English
Weight: 644 KB
Volume: 31
Category: Article
ISSN: 0933-5846
DOI: 10.1007/bf01269946

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reverse mathematics and infinite traceab

Reverse mathematics and infinite traceable graphs

✍ Peter Cholak; David Galvin; Reed Solomon 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

## 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

Connected components of arithmetic graph

Connected components of arithmetic graphs

✍ Melvyn B. Nathanson 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 176 KB

Reverse Mathematics and Grundy colorings

Reverse Mathematics and Grundy colorings of graphs

✍ James H. Schmerl 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investigated.

Graph Coloring and Reverse Mathematics

✍ James H. Schmerl 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

Reverse mathematics and rank functions f

Reverse mathematics and rank functions for directed graphs

✍ Jeffry L. Hirst 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 95 KB

Reverse Mathematics and Recursive Graph

Reverse Mathematics and Recursive Graph Theory

✍ William Gasarch; Jeffry L. Hirst 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 511 KB

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.