11 citations · 27 across the 17 of their papers we have counts for
1 paper · 2 filters
Per Austrin, Kilian Risse
We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex bein…