The next Dartmouth Logic Seminar will be on Wednesday, May 21, at 3pm in Kemeny 120.

Title: How hard is it to find a connected component of a graph?

Speaker: Carl Mummert (Marshall University)

Abstract: I will talk about recent work with Kirill Gura and Jeff Hirst on the reverse mathematics of graph theory inspired by the problem of finding a single connected component of a graph. We analyze this and related problems from the viewpoints of computability, reverse mathematics, and Weihrauch reducibility.