paper

Chvátal's conjecture: a proof from The Book

arXiv:2609.28404

Abstract

Chvátal conjectured that every downset has a maximum-size intersecting family which is a star, that is, consists of all members of the downset containing a fixed element. Recently, Chang, Liu and Liu gave a proof of this conjecture, which follows as a corollary of more general results such as Kleitman's conjecture and a version of Kahn's conjecture (which they also prove). We give a short, direct (spectral) proof of Chvátal's conjecture, and a proof of Kleitman's conjecture along the same lines. We also prove a strengthening of Chvátal's conjecture concerning the projection packing number. Finally, we propose two spectral Chvátal conjectures which are motivated by extensive numerical experiments.

9 pages; we have added the short spectral proof of Kleitman's conjecture, along the same lines as the proof of Chvatal's conjecture in the first version of this manuscript