English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We prove that the propositional translations of the Kneser-Lov\'asz theoremhave polynomial size extended Frege proofs and quasi-polynomial size Fregeproofs. We present a new counting-based combinatorial proof of theKneser-Lov\'asz theorem that avoids the topological arguments of prior proofsfor all but finitely many cases for each k. We introduce a miniaturization ofthe octahedral Tucker lemma, called the truncated Tucker lemma: it is openwhether its propositional translations have (quasi-)polynomial size Frege orextended Frege proofs.

Short Proofs of the Kneser-Lov\'asz Coloring Principle