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 FormCharacterization Theorem 1 StatementA complete characterization of the f-vectors of abstract simplicial complexes. 1 Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
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
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.