  Recently, Pasarkar, Papadimitriou, and Yannakakis (ITCS 2023) have introduced
the new TFNP subclass called PLC that contains the class PPP; they also have
proven that several search problems related to extremal combinatorial
principles (e.g., Ramsey's theorem and the Sunflower lemma) belong to PLC. This
short paper shows that the class PLC also contains PLS, a complexity class for
TFNP problems that can be solved by a local search method. However, it is still
open whether PLC contains the class PPA.
