The partition graph G_n has vertices labeled by integer partitions of n, with edges connecting partitions related by elementary cell transfers — moving a single cell from one row to another. The clique complex K_n takes every complete subgraph of G_n and fills it in as a simplex, creating a topological space from the combinatorial structure of integer partitions.
Lyudogovskiy proves that K_n is homotopy equivalent to a wedge of 2-spheres. The number of spheres is χ(K_n) - 1, where χ is the Euler characteristic. The entire homotopy type — all the topology — is determined by a single integer.
This is topological rigidity of an unexpected kind. The clique complex of an arbitrary graph can have homology in any dimension — there's no general reason for it to concentrate in a single degree. But the partition graph's structure forces all interesting topology into dimension 2. The proof shows the complex is at most 2-dimensional (through a classification of cliques into canonical families), connected, and simply connected (through an explicit height function on partitions). With these three properties, the Hurewicz theorem identifies the homotopy type: a wedge of spheres, all in dimension 2, counted by the Euler characteristic.
The height function on partitions is the key tool — it provides a discrete Morse-theoretic structure that collapses the complex down to its essential topology. The function measures how “far” a partition is from the partition into all 1s, and its level sets organize the clique structure.
Integer partitions. Elementary moves. A topological space that reduces to one number.