[Paper Review] The Junta Method for Hypergraphs and the Erd\H{o}s-Chv\'{a}tal Simplex Conjecture

Nathan Keller, Noam Lifshitz|arXiv (Cornell University)|Jul 9, 2017

Limits and Structures in Graph Theory66 references16 citations

TL;DR

This paper introduces the junta approximation method for hypergraphs to resolve extremal problems involving forbidden hypergraph expansions, including the Erd\'os-Chv\'{a}tal simplex conjecture. It proves that for sufficiently large $ n $, the maximum size of a $ k $-uniform family without a $ d $-simplex is $ \binom{n-1}{k-1} $, confirming the conjecture for all $ d $ and $ k $ when $ n > n_0(d) $.

ABSTRACT

Numerous problems in extremal hypergraph theory ask to determine the maximal size of a $k$-uniform hypergraph on $n$ vertices that does not contain an `enlarged' copy $H^+$ of a fixed hypergraph $H$. These include well-known problems such as the Erd\H{o}s-S\'{o}s `forbidding one intersection' problem and the Frankl-F\"{u}redi `special simplex' problem. We present a general approach to such problems, using a `junta approximation method' that originates from analysis of Boolean functions. We prove that any $H^+$-free hypergraph is essentially contained in a `junta' -- a hypergraph determined by a small number of vertices -- that is also $H^+$-free, which effectively reduces the extremal problem to an easier problem on juntas. Using this approach, we obtain, for all $C<k<n/C$, a complete solution of the extremal problem for a large class of $H$'s, which includes the aforementioned problems, and solves them for a large new set of parameters. We apply our method also to the 1974 Erd\H{o}s-Chv\'{a}tal simplex conjecture, which asserts that for any $d < k \leq \frac{d}{d+1}n$, the maximal size of a $k$-uniform family that does not contain a $d$-simplex (i.e., $d+1$ sets with empty intersection such that any $d$ of them intersect) is ${{n-1}\choose{k-1}}$. We prove the conjecture for all $d$ and $k$, provided $n>n_0(d)$.

Motivation & Objective

• To resolve the Erd\'os-Chv\'{a}tal simplex conjecture on the maximum size of a $ k $-uniform family without a $ d $-simplex.
• To develop a general method for solving Tur\'{a}n-type problems in hypergraphs involving forbidden expansions.
• To establish that $ H^+ $-free hypergraphs are essentially contained in juntas, reducing complex extremal problems to simpler ones on small sets.
• To extend the solution to a broad class of forbidden configurations beyond the simplex, including matching and intersection problems.
• To provide a unified framework using junta approximation and shadow theory for extremal hypergraph problems.

Proposed method

• Applies the junta approximation method, showing that any $ H^+ $-free hypergraph is essentially contained in a $ H^+ $-free junta with few vertices.
• Uses the concept of 'fair' sets and conditional measures to analyze the structure of large families.
• Employs cross-intersection theorems and shadow theory to bound the measure of families restricted to subsets.
• Applies a 'Sudoku step' argument to iteratively eliminate slices of families not containing a key vertex, proving containment in a star.
• Uses a bootstrapping argument based on the density of families and their slices to refine bounds.
• Leverages the junta method to reduce the problem to a constant-sized core, enabling inductive and measure-theoretic analysis.

Experimental results

Research questions

• RQ1 What is the maximum size of a $ k $-uniform hypergraph on $ n $ vertices that does not contain a $ d $-simplex?
• RQ2 Can the junta approximation method be used to solve Tur\'{a}n-type problems for hypergraph expansions?
• RQ3 For which parameters is the Erd\'os-Chv\'{a}tal simplex conjecture true, and can it be proven for all $ d $ and $ k $?
• RQ4 How can the structure of $ H^+ $-free families be approximated by juntas to simplify extremal analysis?
• RQ5 Under what conditions does a large family without a $ d $-simplex necessarily lie within a star?

Key findings

• The Erd\'os-Chv\'{a}tal simplex conjecture is proven for all $ d $ and $ k $, provided $ n > n_0(d) $, with the maximum size being $ \binom{n-1}{k-1} $.
• The junta approximation method successfully reduces $ H^+ $-free hypergraph problems to bounded-vertex juntas, enabling structural analysis.
• For $ k \leq \frac{d-1}{d}n $, the conjecture holds for all $ n > n_0(d) $, confirming the extremal size as $ \binom{n-1}{k-1} $.
• The method establishes that any $ H^+ $-free family is essentially contained in a $ H^+ $-free junta, with the junta depending on only $ O_d(1) $ vertices.
• The 'Sudoku step' argument proves that if a family avoids certain slices, it must be contained in a star, completing the proof for the simplex case.
• The paper resolves the Frankl-F\"{u}redi 'special simplex' problem and the Erd\'os-S\'{o}s 'forbidding one intersection' problem as special cases within the same framework.