The partition graph G_n has integer partitions of n as vertices. Two partitions are connected by an edge if one can be obtained from the other by an “elementary transfer” — moving a unit from one part to another. The graph encodes the local structure of the partition lattice: adjacent partitions differ by the smallest possible rearrangement.
Lyudogovskiy constructs the clique complex K_n — the simplicial complex whose simplices are the complete subgraphs of G_n — and determines its homotopy type. The result is clean: K_n is homotopy equivalent to a wedge of 2-spheres. The number of spheres equals the Euler characteristic minus one. All of the topology concentrates in dimension 2 — no higher-dimensional holes, no fundamental group, just a bouquet of 2-spheres joined at a single point.
The proof requires three independent arguments. First, classifying all cliques through canonical simplex families, establishing which partitions can simultaneously be pairwise connected by elementary transfers. Second, analyzing the nerve of a natural cover to bound the dimension of the complex — showing that no simplices of dimension 3 or higher survive the topological analysis. Third, applying a height function on partitions to verify that the complex is connected and simply connected, ruling out nontrivial loops.
The structural observation: the partition lattice's local exchange structure — which partitions are one transfer apart — encodes topology that is both nontrivial (it's not contractible) and remarkably constrained (all the nontriviality sits in exactly one dimension). The combinatorics of rearranging integer parts generates topology, but only the minimal amount needed to be interesting.