Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Kruskal-Katona Theorem

Combinatorics and Graph Theory

The Kruskal-Katona Theorem, a result of algebraic combinatorics, gives a complete characterization of the f-vectors of abstract simplicial complexes, the sequences recording how many faces of each dimension a complex contains. It includes the Erdos-Ko-Rado Theorem as a special case and can also be restated in terms of uniform hypergraphs. It is named after Joseph Kruskal and Gyula Katona, though it was discovered independently by several others as well.

Facts
Classification
Statement Form
Characterization Theorem 1
Statement
A complete characterization of the f-vectors of abstract simplicial complexes. 1
Connections

Has Statement Form

In Branch

Source Kruskal-Katona theorem (Wikipedia)

Proved By

Source Kruskal-Katona theorem (Wikipedia)
Sources
1. Kruskal-Katona theorem (Wikipedia)
  • Intro, sentence 1
    gives a complete characterization of the f-vectors of abstract simplicial complexes
  • In Branch: Combinatorics, Lead sentence
  • Proved By: Joseph Kruskal, Lead section
    It is named after Joseph Kruskal
  • In Group: Enumerative, Additive and Algebraic Combinatorics, Lead section
    In algebraic combinatorics, the Kruskal-Katona theorem gives a complete
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.