Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 23 Sep 2026 in math.CO | (2609.28404v1)

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 family 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 also prove a strengthening concerning the projection packing number. We also propose two spectral Chvátal conjectures which are motivated by extensive numerical experiments.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.