Internet Archive Scholar

The computational strength of matchings in countable graphs [article]

Stephen Flood, Matthew Jura, Oscar Levin, Tyler Markkanen
2020 arXiv   pre-print

Preserved Fulltext

Web Archive Capture PDF (604.3 kB)
https://web.archive.org/web/20200624055949/https://arxiv.org/pdf/2006.11334v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a number of natural variants of these theorems are equivalent, or closely related, to the "big five" subsystems of reverse mathematics. The results of this paper explore the relationship between graph theory and logic by showing the way in which specific changes
more » ... a single graph-theoretic principle impact the corresponding proof-theoretical strength. Taken together, the results and questions of this paper suggest that the existence of matchings in countable graphs provides a rich context for understanding reverse mathematics more broadly.
arXiv:2006.11334v1 fatcat:gnjsgfyngnajbkswztsoua2wdy
Citation

Stephen Flood, Matthew Jura, Oscar Levin, Tyler Markkanen. "The computational strength of matchings in countable graphs." arXiv (2020)