Perfect matching for regular graphs is AC0-hard for the general matching problem

摘要

We prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-connected 4-regular graphs) is AC0-equivalent with the general perfect matching problem for arbitrary graphs.