6 citations · 9 across the 5 of their papers we have counts for
6 papers
The computational strength of matchings in countable graphs
Stephen Flood, Matthew Jura, Oscar Levin +1
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 stre…
Effectiveness for the Dual Ramsey Theorem
Damir Dzhafarov, Stephen Flood, Reed Solomon +1
We analyze the Dual Ramsey Theorem for partitions and colors () in the context of reverse math, effective analysis, and strong reductions. Over $\ma…
Separating Principles Below WKL0
Stephen Flood, Henry Towsner
In this paper, we study Ramsey-type Konig's Lemma, written RWKL, using a technique introduced by Lerman, Solomon, and the second author. This technique uses iterated forcing to con…
A packed Ramsey's theorem and computability theory
Stephen Flood
Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f…
Reverse mathematics and a Ramsey-type König's Lemma
Stephen Flood
In this paper, we propose a weak regularity principle which is similar to both weak König's lemma and Ramsey's theorem. We begin by studying the computational strength of this prin…
A Tur'an-type problem for circular arc graphs
Rosalie Carlson, Stephen Flood, Kevin O'Neill +1
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem for circular arc graphs: for n arcs, if m and M are t…