Chvatal's conjecture and correlation inequalities

Ehud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller

Research output: Contribution to journalArticlepeer-review

Abstract

Chvatal'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 is an element of 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. (C) 2017 Elsevier Inc. All rights reserved.

Original languageEnglish
Pages (from-to)22-43
Number of pages22
JournalJournal Of Combinatorial Theory Series A
Volume156
DOIs
StatePublished - May 2018

Keywords

  • Chvátal's conjecture
  • Correlation inequalities
  • Discrete Fourier analysis
  • Extremal combinatorics
  • Influences

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Chvatal's conjecture and correlation inequalities'. Together they form a unique fingerprint.

Cite this