Proof Complexity and the Kneser-Lovász Theorem

Gabriel Istrate, Adrian Crăciun

We investigate the proof complexity of a class of propositional formulas expressing a combinatorial principle known as the Kneser-Lovász Theorem. This is a family of propositional…