The upper and lower bounds for extremal combinatorics problems often come from different proof techniques, and there is frequently an asymptotic gap between them that is difficult to close, making them naturally suited to the SqueezeBench framework of maintaining upper and lower bounds and continuously tightening them.