The paper I've been focusing on is Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs The idea is to figure out why the degree of the expander need be so large? Can we show the same hardness results for constant degree expanders?
Below are notes made for future reference: