

























Abstract:Chvátal conjectured that amongst the largest intersecting subfamilies of a finite subset-closed family of sets is a star. Kleitman later strengthened Chvátal's conjecture, defining a partial ordering on the vector space freely generated by $2^{[n]}$ and suggesting that the vector of every maximal intersecting subfamily of $2^{[n]}$ is bigger than a convex combination of stars. We restate Kleitman's conjecture in terms of the cochain complex of the discrete cube, studying it with techniques from convex optimization.
From: Jonathan Cary [view email]
[v1]
Mon, 5 Feb 2024 16:17:36 UTC (6 KB)
[v2]
Mon, 25 Mar 2024 02:44:57 UTC (7 KB)
[v3]
Sun, 31 May 2026 10:39:14 UTC (11 KB)
[v4]
Sun, 14 Jun 2026 16:46:11 UTC (11 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。