Chvátal's conjecture and correlation inequalities.
Journal of Combinatorial Theory, Series A(2018)
摘要
Chvátal's conjecture in extremal combinatorics asserts that for any decreasing family F of subsets of a finite set S, there is a largest intersecting subfamily of F consisting of all members of F that include a particular x∈S. In this paper we reformulate the conjecture in terms of influences of variables on Boolean functions and correlation inequalities, and study special cases and variants using tools from discrete Fourier analysis.
更多查看译文
关键词
Extremal combinatorics,Chvátal's conjecture,Correlation inequalities,Discrete Fourier analysis,Influences
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络