Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1016/j.jcta.2017.11.015 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Extremal combinatorics,Chvátal's conjecture,Correlation inequalities,Discrete Fourier analysis,Influences | Boolean function,Discrete mathematics,Combinatorics,Finite set,Correlation,Extremal combinatorics,Conjecture,Mathematics,Discrete fourier analysis | Journal |
Volume | ISSN | Citations |
156 | 0097-3165 | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ehud Friedgut | 1 | 440 | 38.93 |
Jeff Kahn | 2 | 304 | 42.26 |
Gil Kalai | 3 | 469 | 68.53 |
Nathan Keller | 4 | 10 | 1.62 |