Chv\'{a}tal's Conjecture and Correlation Inequalities

Chv'{a}tal’s conjecture in extremal combinatorics asserts that for any decreasing family $\mathcal{F}$ of subsets of a finite set $S$, there is a largest intersecting subfamily of $\mathcal{F}$ consisting of all members of $\mathcal{F}$ that include a particular $x\in 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.