Equitable Partitions in Graph Theory

Updated 24 March 2026

Equitable partitions are vertex divisions with uniform inter-class connectivity, ensuring regular adjacency counts across cells.
They underpin spectral compression and model reduction, enabling efficient analysis and clustering in algebraic and combinatorial structures.
Generalizations to directed, mixed, and approximate cases broaden applications in network science, control systems, and multi-agent robotics.

Equitable partitions are a fundamental structural concept in algebraic and combinatorial graph theory, association schemes, polyhedral combinatorics, and network science. They formalize vertex partitions for which adjacency (or, more broadly, system interaction) between partition classes is completely regular—leading to deep links with symmetry, roles, network compression, and model reduction in both discrete and continuous systems.

1. Formal Definition and Spectral Framework

Given a (simple or directed) graph $G=(V,E)$ with adjacency matrix $A$ , a partition $\mathcal{C} = \{C_1, ..., C_k\}$ of $V$ is called equitable if for every pair $(i, j)$ and every $u, v \in C_i$ , the number of neighbors in $C_j$ is the same: $\forall\,1 \leq i,j \leq k,\ \forall\,u,v \in C_i: \quad |N(u) \cap C_j| = |N(v) \cap C_j|.$ This is equivalently expressed as a matrix equation using the indicator matrix $H \in \{0,1\}^{n \times k}$ : $A H = H B,$ where $B$ is the $k \times k$ quotient matrix whose entries $b_{ij}$ record the uniform neighbor-counts between cells. Thus, the eigenvalues of $B$ (with at least the same multiplicity) appear in $\operatorname{Spec}(A)$ ; these are called the lifted eigenvalues (Thüne, 2016).

2. Classification in Key Graph Families

Hamming and Johnson Graphs

Hamming Graphs: In $H(n,q)$ $H (n, q)$ , equitable $2$-partitions with $\lambda_2(n,q) = (q-1)n-2q$ $λ_{2} (n, q) = (q - 1) n - 2 q$ as nontrivial eigenvalue are completely classified: every reduced partition is either a lift from $H(3,q)$ $H (3, q)$ , a “permutation-switching” lift from $H(2,q)$ $H (2, q)$ , or (when $q$ $q$ is even) an “alphabet-lift” of the unique equitable partition of $H(4,2)$ $H (4, 2)$ . These correspond to three explicit construction types (Mogilnykh et al., 2019):
- Type A: Permutation-switching lifts (from $H(2,q)$ )
- Type B: Alphabet lifting of two induced $8$-cycles in $H(4,2)$ (only for even $q$ )
- Type C: Partitions induced from $H(3,q)$
Johnson Graphs: For $J(n,w)$ , equitable $2$-partitions with nontrivial eigenvalue $\lambda_2(w,n) = (w-2)(n-w-2)-2$ exist only for $n = 2w$ . For $w \geq 7$ , exactly four infinite families occur, each specified by a small set of fixed substrings in designated coordinate positions. The possible quotient matrices and constructions are classified combinatorially (Vorob'ev, 2020).

Latin-Square Graphs

In Latin-square graphs $\Gamma(A)$ , every equitable partition whose quotient matrix avoids the smallest eigenvalue $-3$ combines unions of rows, columns, letters, or “inflated” cyclic-corner sets. Mixed cases yielding all three eigenvalues have a tight polyhedral classification (Bailey et al., 2018).

3. Generalizations to Directed, Mixed, and Weighted Cases

Directed Graphs: For digraphs, branchings and $b$ -branchings admit equitable arc partitions—not only with balanced part sizes, but also balancing the vertex in-degree across parts to $\lfloor d_A^-(v)/k \rfloor$ or $\lceil d_A^-(v)/k \rceil$ for each $v \in V$ (Takazawa, 2020).
Mixed Graphs: For matching forests in mixed graphs (undirected edges $E$ and arcs $A$ ), a natural equitability criterion is balancing the number of covered vertices amongst the parts, which can always be achieved to within $2$ (Takazawa, 2020).
Signed Graphs and Strong Regularity: Equitable partitions extend to signed graphs, allowing the spectrum of quotient matrices to control the eigenvalues of signings—crucial for the construction of Ramanujan graphs and explicit solutions to the Bilu–Linial conjecture in certain families (Alinejad et al., 2021).

4. Polyhedral, Exchange, and Algorithmic Properties

Integer-Decomposition Property and Polyhedra

The set of characteristic vectors of $b$ -branchings forms a polytope with the integer-decomposition property (IDP). Fixed-size and fixed-indegree faces also inherit this property, which supports decomposition and synthesis of solutions to partitioning and flow problems (Takazawa, 2020). Similar TDI (totally dual integral) systems describe partition polytopes for matching forests and mixed edge covers (Király et al., 2018).

Exchange Lemmas and Swap-Based Algorithms

Key constructive proofs use exchange lemmas (generalizations of Schrijver’s branching exchange) and minimization-swap arguments to iteratively rebalance sizes and local constraints across partition classes, always reducing a discrepancy measure and leading to strongly polynomial-time algorithms for finding equitable partitions wherever existence is guaranteed (Takazawa, 2020, Király et al., 2018).

5. Approximate Equitable Partitions and Network Role Embedding

Strict equitability rarely occurs in large or noisy real-world networks. Recent developments introduce the notion of $\varepsilon$ -equitable partitions: $\left|\, |N(u)\cap C_j| - |N(v)\cap C_j|\,\right| \leq \varepsilon$ for all $u,v \in C_i$ , $1 \leq i,j \leq k$ and prescribed tolerance $\varepsilon \geq 0$ (Squillace et al., 2024). Efficient refinement algorithms generalize classical Paige–Tarjan partitioning to compute $\varepsilon$ -equitable partitions in $O(mn)$ time. Such partitions underlie scalable network embedding algorithms: the $\varepsilon$ -equitable role embedding provides competitive or superior performance to deep learning and random walk methods, at dramatically lower computational cost and with strong interpretability guarantees (Squillace et al., 2024, Scholkemper et al., 2023).

6. Connections to Association Schemes, Tensors, and Continuous Systems

Association Schemes: In symmetric association schemes, equitable partitions correspond to invariant-subspace decompositions for the Bose–Mesner algebra, and their quotient matrices realize spectral compression. Necessary conditions for their existence reduce to Lloyd’s theorem on spectrum divisibility (Gavrilyuk et al., 2013).
Tensors and Hypergraphs: The equitable-partition theorem for tensors allows quotienting a symmetric tensor (e.g., a hypergraph adjacency tensor) along a partition, with all H-eigenvalues of the quotient tensor appearing in the full spectrum. This generalizes classical eigenvalue-lifting results and supports model order reduction in multilinear algebra (Jin et al., 2018).
Continuous Systems and ODE Lumpability: The equitable partition framework exactly characterizes backward equivalence (lumpability) in Markov chains and in the linear ODE system $x' = Ax$ . Both exact and $\varepsilon$ -approximate partitioning correspond to invariant or approximately invariant subspaces for aggregated variables (Squillace et al., 2024).

7. Applications and Broad Impact

Combinatorial Structures: Equitable partitions connect with orthogonal arrays, correlation-immune functions, perfect colorings, and the construction/classification of strongly regular and distance-regular graphs (Krotov, 2020, Gyürki, 2015, Terwilliger et al., 13 Dec 2025).
Dynamics and Control: In oscillator network synchronization (Kuramoto models), every equitable partition induces an exact cluster synchronization, and recent generalizations to $\alpha$ -Kuramoto partitions subsume all equitable partitions as special cases (Kirkland et al., 2013).
Distributed Algorithms and Robotics: Equitability serves as the principle for convex partitioning of workspaces in mobile multi-agent systems, producing convex, balanced regions for optimal resource allocation, and admitting provably convergent decentralized algorithms (0903.5267).
Spectral Theory and Network Compression: The block-triangularization of matrices in the presence of equitability enables compressing network/graph computations and spectral analysis, with precise control over the error introduced in the approximate case (Thüne, 2016).

References:

(Mogilnykh et al., 2019) Mogilnykh, Valyuzhenich, "Equitable 2-partitions of the Hamming graphs with the second eigenvalue"
(Vorob'ev, 2020) Mogilnykh, Valyuzhenich, "Equitable 2-partitions of Johnson graphs with the second eigenvalue"
(Bailey et al., 2018) Bailey, Cameron, Gavrilyuk, Goryainov, "Equitable partitions of Latin-square graphs"
(Király et al., 2018) Babenko, Karzanov, Takazawa, "Equitable Partitions into Matchings and Coverings in Mixed Graphs"
(Takazawa, 2020) Takazawa, "Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$ -branchings in Digraphs"
(Squillace et al., 2024) De Nicola, Simeoni, Gorla, "Efficient Network Embedding by Approximate Equitable Partitions"
(Scholkemper et al., 2023) Scholkemper & Schaub, "An Optimization-based Approach To Node Role Discovery in Networks: Approximating Equitable Partitions"
(Thüne, 2016) Liu, Schneider, Shadrin, Torsello, "Exploiting Equitable Partitions for Efficient Block Triangularization"
(Gavrilyuk et al., 2013) Muzychuk, "On the Godsil -- Higman necessary condition for equitable partitions of association schemes"
(Alinejad et al., 2021) Alinejad, Fulad, "Equitable partitions for Ramanajun graphs"
(Jin et al., 2018) Jin, Zhang, Zhang, "Equitable Partition Theorem of Tensors and Spectrum of Generalized Power Hypergraphs"
(0903.5267) Pavone et al., "Equitable Partitioning Policies for Mobile Robotic Networks"
(Kirkland et al., 2013) Bailey, Cameron, Pralat, "alpha-Kuramoto partitions: graph partitions from the frustrated Kuramoto model generalise equitable partitions"
(Krotov, 2020) Krotov, Vorob'ev, "Equitable [[2,10],[6,6]]-partitions of the 12-cube"
(Terwilliger et al., 13 Dec 2025) Suzuki, Tanaka, "An equitable partition for the distance-regular graph of the bilinear forms"
(Gyürki, 2015) Gyürki, Klin, Muzychuk, Nowitz, "New infinite families of directed strongly regular graphs via equitable partitions"
(Hellmuth et al., 2013) Imrich, Klavžar, Zemljič, "Square Property, Equitable Partitions, and Product-like Graphs"
(Kim et al., 2019) Kim, Oum, Zhang, "Equitable partition of planar graphs"