The logical strength of König's edge coloring theorem

Carl Mummert

König's edge coloring theorem says that a bipartite graph with maximal degree $n$ has an edge coloring with no more than $n$ colors. We explore the computability theory and Reverse…