Kruskal–Katona theorem

Template:Short description In algebraic combinatorics, the Kruskal–Katona theorem gives a complete characterization of the f-vectors of abstract simplicial complexes. It includes as a special case the Erdős–Ko–Rado theorem and can be restated in terms of uniform hypergraphs. It is named after Joseph Kruskal and Gyula O. H. Katona, but has been independently discovered by several others.

Statement

Given two positive integers N and i, there is a unique way to expand N as a sum of binomial coefficients as follows:

<math> N=\binom{n_i}{i}+\binom{n_{i-1}}{i-1}+\ldots+\binom{n_j}{j},\quad

n_i > n_{i-1} > \ldots > n_j \geq j\geq 1. </math>

This expansion can be constructed by applying the greedy algorithm: set n_i to be the maximal n such that <math> N\geq \binom{n}{i}, </math> replace N with the difference, i with i − 1, and repeat until the difference becomes zero. Define

<math> N^{(i-1)}=\binom{n_i}{i-1}+\binom{n_{i-1}}{i-2}+\ldots+\binom{n_j}{j-1}. </math>

Statement for simplicial complexes

An integral vector <math>(f_0, f_1, ..., f_{d-1})</math> is the f-vector of some <math>(d-1)</math>-dimensional simplicial complex if and only if

<math> 0 \leq f_{i}^{(i)} \leq f_{i-1},\quad 1\leq i\leq d-1.</math>

Statement for uniform hypergraphs

Let A be a set consisting of N distinct i-element subsets of a fixed set U ("the universe") and B be the set of all <math>(i-r)</math>-element subsets of the sets in A. Expand N as above. Then the cardinality of B is bounded below as follows:

<math> |B| \geq \binom{n_i}{i-r}+\binom{n_{i-1}}{i-r-1}+\ldots+\binom{n_j}{j-r}. </math>

Lovász' simplified formulation

The following weaker but useful form is due to Template:Harvs. Let A be a set of i-element subsets of a fixed set U ("the universe") and B be the set of all <math>(i-r)</math>-element subsets of the sets in A. If <math>|A| = \binom{x}{i}</math> then <math>|B| \geq \binom{x}{i-r}</math>.

In this formulation, x need not be an integer. The value of the binomial expression is <math>\binom{x}{i} = \frac{x(x-1)\dots(x-i+1)}{i!}</math>.

Ingredients of the proof

For every positive i, list all i-element subsets a₁ < a₂ < … a_i of the set N of natural numbers in the colexicographical order. For example, for i = 3, the list begins

<math> 123, 124, 134, 234, 125, 135, 235, 145, 245, 345, \ldots. </math>

Given a vector <math>f = (f_0, f_1, ..., f_{d-1})</math> with positive integer components, let Δ_f be the subset of the power set 2^N consisting of the empty set together with the first <math>f_{i-1}</math> i-element subsets of N in the list for i = 1, …, d. Then the following conditions are equivalent:

1. Vector f is the f-vector of a simplicial complex Δ.
2. Δ_f is a simplicial complex.
3. <math> f_{i}^{(i)} \leq f_{i-1},\quad 1\leq i\leq d-1.</math>

The difficult implication is 1 ⇒ 2.

History

The theorem is named after Joseph Kruskal and Gyula O. H. Katona, who published it in 1963 and 1968 respectively. According to Template:Harvtxt, it was discovered independently by Template:Harvtxt, Template:Harvtxt, Template:Harvs, Template:Harvtxt, and Template:Harvtxt. Template:Harvs writes that the earliest of these references, by Schützenberger, has an incomplete proof.

See also

• Sperner's theorem

References

• Template:Citation. Reprinted in Template:Citation
• Template:Citation
• Template:Citation. Reprinted in Template:Harvtxt.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation
• Template:Citation.
• Template:Citation.

External links

• Kruskal-Katona theorem on the polymath1 wiki