Integral Spanning in Graph Theory

• Integral spanning is the study of spanning trees, forests, and subgraphs defined by integral constraints, central to combinatorial optimization and graph theory.
• It employs methods like LP rounding, Tutte-polynomial analysis, and algebraic techniques to ensure solutions are integral, with applications in network design and probabilistic analysis.
• The topic bridges diverse areas including Ehrhart theory and cohomology, opening avenues for precise enumeration and structural insights in optimization problems.

Searching arXiv for recent and foundational papers related to “integral spanning” and adjacent graph-theoretic uses of “spanning” to ground the article. First, I’ll look for papers specifically using “integral spanning” or closely related spanning structures in graph theory, combinatorics, and optimization. “Integral spanning” is not presented in the literature as a single standardized formalism. As an Editor’s term, it usefully groups work on spanning trees, forests, subgraphs, walks, configurations, and polytopes in which integrality is the governing feature: the spanning object itself is required to be integral, a fractional relaxation is rounded to an integral spanning solution, or the relevant invariants appear as integral cohomology, integral roots, or integral formulas. Under that umbrella, the subject includes expected minimal spanning tree length via Tutte-polynomial integrals, half-integral LP rounding for edge- and arc-connectivity problems, degree- and leaf-constrained spanning trees, moduli of spanning subspace configurations, increasing spanning-forest enumerators, and spanning lattice polytopes (Nishikawa et al., 2015, Boyd et al., 2020, Hershkowitz et al., 2020, Rhoades, 2019, Hallam et al., 2016, Hofscheier et al., 2016).

1. Conceptual scope of integrality in spanning problems

The literature uses integrality in several mathematically distinct senses. In combinatorial optimization, integrality usually means that the output is a genuine spanning tree or spanning subgraph rather than a fractional LP point. This is the setting of the Minimum $2$-Edge Connected Spanning Multisubgraph problem, the weighted minimum strongly connected spanning subgraph problem, and the $k$-edge-connected spanning subgraph problem, where half-integral or approximately optimal fractional solutions are converted into integral spanning objects with explicit approximation guarantees (Boyd et al., 2020, Hershkowitz et al., 2020, Chalermsook et al., 2022).

A second sense concerns integer-valued local constraints on spanning structures. Here the spanning object is still a tree or walk, but its existence is controlled by prescribed degree bounds, visit bounds, leaf counts, or designated internal vertices. Theorems in this direction give sufficient component-count conditions for bounded-degree spanning trees and bounded-visit spanning closed walks, prove contiguity of the attainable numbers of leaves in spanning trees, and analyze minimum-weight spanning trees in which a prescribed set of vertices must be internal (Hasanvand, 2017, Noguchi et al., 2023, Hanaka et al., 2023).

A third sense is algebraic or topological. The moduli space of spanning configurations in $\mathbb{C}^k$ has an integral cohomology ring presented explicitly as a quotient of $\mathbb{Z}[\mathbf{x}_n]$, increasing spanning forests are counted by a polynomial with nonpositive integral roots, and spanning lattice polytopes are characterized by a gap-free $h^*$-vector (Rhoades, 2019, Hallam et al., 2016, Hofscheier et al., 2016).

A fourth sense is analytic or enumerative. The expected length of a minimal spanning tree can be written as an integral whose integrand is a polynomial determined by spanning subgraphs, and spanning tree generating functions for regular lattices are expressed through integral representations, Mahler measures, and hypergeometric functions (Nishikawa et al., 2015, Guttmann et al., 2012).

2. Integral formulas and enumeration for spanning trees

A foundational probabilistic result in this area is Steele’s formula for the expected length of the minimal spanning tree of a finite, connected, simple graph whose edge weights are independent $\mathrm{Uniform}[0,1]$ variables. If $T(G;x,y)$ is the Tutte polynomial, then

$$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$

The paper "Polynomial representation for the expected length of minimal spanning trees" shows that the integrand is in fact a polynomial

$$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$

of degree at most the number of edges $m$, with explicit coefficient formula

$k$0

The first coefficients are structural: $k$1, $k$2, $k$3, $k$4, $k$5, $k$6, and $k$7 (Nishikawa et al., 2015).

For complete graphs $k$8, the first coefficients become

$k$9

$\mathbb{C}^k$0

and the polynomial factors as $\mathbb{C}^k$1 with $\mathbb{C}^k$2. The paper explicitly notes that these patterns may be leveraged for asymptotic analysis and for deeper understanding of random spanning tree properties (Nishikawa et al., 2015).

Enumeration with a prescribed integral substructure leads to a different but related theory. For a complete multipartite graph $\mathbb{C}^k$3 and a fixed spanning forest $\mathbb{C}^k$4 with components $\mathbb{C}^k$5, the count $\mathbb{C}^k$6 of spanning trees containing $\mathbb{C}^k$7 reduces by contraction to

$\mathbb{C}^k$8

The paper "On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest" derives a determinantal formula for $\mathbb{C}^k$9 using the Generalized Matrix Determinant Lemma and Jacobi’s formula for the derivative of a determinant. If $\mathbb{Z}[\mathbf{x}_n]$0, $\mathbb{Z}[\mathbf{x}_n]$1, and $\mathbb{Z}[\mathbf{x}_n]$2 is the $\mathbb{Z}[\mathbf{x}_n]$3-cofactor of a specified matrix $\mathbb{Z}[\mathbf{x}_n]$4, then

$\mathbb{Z}[\mathbf{x}_n]$5

for any $\mathbb{Z}[\mathbf{x}_n]$6; the case $\mathbb{Z}[\mathbf{x}_n]$7 reduces to the previously known bipartite formula (Wang et al., 3 Feb 2026).

A further analytic development is the spanning tree generating function (STGF) for a regular lattice $\mathbb{Z}[\mathbf{x}_n]$8,

$\mathbb{Z}[\mathbf{x}_n]$9

whose value at $h^*$0 is the spanning tree constant $h^*$1. The derivative satisfies

$h^*$2

where $h^*$3 is the lattice Green function, so that

$h^*$4

For the square lattice, the paper gives $h^*$5, and for the standard two- and three-dimensional lattices it expresses STGFs as Mahler measures and hypergeometric functions (Guttmann et al., 2012).

3. Half-integrality, LP rounding, and integral spanning subgraphs

In survivable network design, integral spanning emerges through rounding the natural LP relaxations. For the Minimum $h^*$6-Edge Connected Spanning Multisubgraph problem, the LP is

$h^*$7

and the half-integral case is characterized by $h^*$8. Carr and Ravi had shown that the integrality gap is at most $h^*$9 in this case. The paper "A $\mathrm{Uniform}[0,1]$0-Approximation Algorithm for the Minimum $\mathrm{Uniform}[0,1]$1-Edge Connected Multisubgraph Problem in the Half-Integral Case" gives a simpler proof via an extension of Lovász’s splitting-off theorem and, crucially, an explicit deterministic algorithm: given a half-integral LP solution $\mathrm{Uniform}[0,1]$2, one can in $\mathrm{Uniform}[0,1]$3 time construct a $\mathrm{Uniform}[0,1]$4-edge connected spanning multisubgraph of cost at most $\mathrm{Uniform}[0,1]$5 (Boyd et al., 2020).

The mechanism is recursive. From a half-integral feasible $\mathrm{Uniform}[0,1]$6, one forms the multigraph $\mathrm{Uniform}[0,1]$7 with $\mathrm{Uniform}[0,1]$8 parallel copies of each edge; $\mathrm{Uniform}[0,1]$9 is then $T(G;x,y)$0-regular and $T(G;x,y)$1-edge connected. Splitting-off admissible pairs of incident edges preserves the required connectivity while reducing the instance by one vertex, and careful edge-cost assignment maintains the inductive cost bound. The key induction theorem states that for a $T(G;x,y)$2-regular, $T(G;x,y)$3-edge connected multigraph $T(G;x,y)$4 and any edge $T(G;x,y)$5, one can in $T(G;x,y)$6 time find a $T(G;x,y)$7-edge connected spanning subgraph $T(G;x,y)$8 of $T(G;x,y)$9 such that $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$0 and $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$1 uses at most one copy of each multiedge; this yields the $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$2 guarantee for the original LP solution (Boyd et al., 2020).

The directed analogue is the weighted minimum strongly connected spanning subgraph problem. Its LP relaxation requires $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$3 for all nonempty proper $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$4. The paper "An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph" proves that half-integral LP solutions can be rounded in polynomial time at multiplicative cost $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$5, and more generally that if every positive variable is at least $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$6, the multiplicative bound is $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$7. The construction uses distributions over in-arborescences and out-arborescences rooted at a chosen vertex $$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$8, with

$$\mathbb{E}[L(G)] = \int_0^1 \frac{1-t}{t} \frac{T_x\left(G; \frac{1}{t}, \frac{1}{1-t}\right)}{T\left(G; \frac{1}{t}, \frac{1}{1-t}\right)} \, dt .$$9

and therefore

$$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$0

For the half-integral case $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$1, this gives the optimal factor $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$2, matching a known $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$3 integrality-gap lower bound for a half-integral instance (Hershkowitz et al., 2020).

For undirected $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$4-edge connectivity, the paper "Approximating $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$5-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver" separates the fractional and integral aspects. It computes a $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$6-approximate fractional solution in time $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$7 and then rounds it to an integral $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$8ECSS of cost at most $$p_m(t) = -1 + \sum_{A \in S(G)} k(A)\, t^{|A|}(1-t)^{m-|A|} = -1 + \sum_{i=0}^m a_i t^i,$$9 times optimum in time

$m$0

The rounding proceeds through cut sparsification and a Khuller–Vishkin reduction to $m$1 edge-disjoint arborescences in a directed support of size $m$2 (Chalermsook et al., 2022).

These results make clear that integrality is not merely a modeling convention. In this part of the literature it is a quantitative objective: the aim is to certify how close an integral spanning subgraph can be to the optimal fractional benchmark.

4. Degree bounds, walks, leaves, and designated internal vertices

The language of integral spanning structures also appears in existence theorems with local constraints. The paper "Spanning trees and spanning closed walks with small degrees" proves that if for all $m$3,

$m$4

then $m$5 has a spanning tree $m$6 containing an arbitrary given matching such that $m$7 for all vertices. It also proves that if for all $m$8,

$m$9

then $k$00 admits a spanning closed walk passing through the edges of an arbitrary given matching and meeting each vertex $k$01 at most $k$02 times; this solves a long-standing conjecture of Jackson and Wormald (Hasanvand, 2017).

The attainable number of leaves in spanning trees exhibits a different integrality phenomenon. If

$k$03

then the paper "Spanning trees for many different numbers of leaves" proves that $k$04 is contiguous for every connected graph. For connected and locally connected graphs of order at least $k$05, including triangulations, this yields spanning trees with exactly $k$06 leaves for every

$k$07

and for plane $k$08-connected $k$09-vertex triangulations there are polynomial-time constructions for every integer $k$10 in that range. The same paper also constructs infinitely many plane $k$11-connected $k$12-vertex triangulations with $k$13 (Noguchi et al., 2023).

A complementary optimization problem is the Minimum Weight Non-Terminal Spanning Tree problem, where a specified set $k$14 must consist of internal vertices in the spanning tree, equivalently $k$15 for all $k$16. This generalizes the standard spanning tree problem and contains $k$17-$k$18 Hamiltonian Path as the special case $k$19. The problem is NP-hard, W[1]-hard when parameterized by clique-width, admits a $k$20-vertex kernel for $k$21, and has an $k$22-time algorithm for polynomially bounded integral edge weights; parameterization by $k$23 gives an $k$24-time algorithm for arbitrary weights (Hanaka et al., 2023).

Exact integral modeling also appears in the constrained optimum communication spanning tree problem. The paper "Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem" models pairwise distances directly by integral variables $k$25 together with binary edge variables $k$26, using Bellman-type recursions and the algebraic relation

$k$27

In the reported experiments, the novel linear distance-based formulations are superior to the traditional multicommodity flow model, and the distance-based MILP formulations are stated to be 35 times faster for $k$28 and $k$29 (Veremyev et al., 2021).

5. Integral cohomology, integral roots, and spanning geometry

In algebraic combinatorics and geometry, spanning objects are often studied through integral invariants rather than through optimization. A spanning configuration in $k$30 is a sequence $k$31 of subspaces with prescribed dimensions $k$32 such that

$k$33

Its moduli space

$k$34

is a Zariski open subset of a product of Grassmannians. The paper "Spanning subspace configurations" gives the integral cohomology presentation

$k$35

where $k$36 is generated by the top $k$37 elementary symmetric polynomials in all variables and by the complete homogeneous symmetric polynomials $k$38 for $k$39. This simultaneously generalizes Borel’s presentation for partial flag varieties and the cohomology of spanning line configuration spaces associated with the Haglund–Remmel–Wilson Delta Conjecture (Rhoades, 2019).

The polynomial theory of increasing spanning forests exhibits a different form of integrality. If $k$40 has vertices $k$41 and $k$42, then the generating polynomial for increasing spanning forests is

$k$43

Hence all roots are nonpositive integers. Hallam and Sagan had shown this factorization, and the later paper provides new combinatorial proofs, bounds the coefficients using broken circuits, and extends the theory to cage-free simplicial complexes and labeled multigraphs. Moreover,

$k$44

if and only if the labeling is a perfect elimination order (Hallam et al., 2016).

The phrase “spanning” also enters Ehrhart theory. A lattice polytope $k$45 is spanning if every lattice point in $k$46 is an integral affine combination of lattice points of $k$47. The paper "Ehrhart Theory of Spanning Lattice Polytopes" proves that the $k$48-vector of a spanning lattice polytope has no gaps: if $k$49 is spanning, then

$k$50

As a consequence, the paper derives the inequality

$k$51

described there as a polyhedral consequence of the Eisenbud–Goto conjecture (Hofscheier et al., 2016).

6. Structural synthesis, terminology, and open directions

Taken together, these works suggest that “integral spanning” is best understood as a structural motif rather than a single theorem or model. The common thread is that a spanning requirement is coupled to an integrality phenomenon: exact selection of edges or arcs, integral multiplicities, integral root or cohomology behavior, or integral analytic representations. The principal methods are correspondingly diverse: Tutte-polynomial differentiation and spanning-subgraph expansions for random MSTs, Laplacian determinants and contraction for enumeration, splitting-off and arborescence decompositions for approximation, Bellman-type recursions for mixed-integer formulations, mixed reduction and orbit harmonics for cohomology, and half-open triangulations for $k$52-theory (Nishikawa et al., 2015, Wang et al., 3 Feb 2026, Boyd et al., 2020, Veremyev et al., 2021, Rhoades, 2019, Hofscheier et al., 2016).

A persistent misconception is that “integral” in spanning problems refers only to integer edge weights. The cited literature shows otherwise. In 2ECM and WMSCSS, the salient issue is rounding half-integral LP solutions to integral spanning subgraphs (Boyd et al., 2020, Hershkowitz et al., 2020). In spanning configurations, the decisive property is integral cohomology over $k$53 (Rhoades, 2019). In increasing spanning forests, it is complete factorization with nonpositive integral roots (Hallam et al., 2016). In spanning lattice polytopes, it is the arithmetic spanning condition and the induced no-gap behavior of the $k$54-vector (Hofscheier et al., 2016).

Several open-ended directions remain visible within the surveyed material. For complete graphs, the coefficient patterns in the MST integrand are explicitly said to hint at asymptotic analysis (Nishikawa et al., 2015). For $k$55ECM, the Four-Thirds Conjecture remains the long-standing benchmark beyond the half-integral case (Boyd et al., 2020). In Ehrhart theory, the no-gap theorem is presented as a modest analog of unimodality, while unimodality questions themselves remain open for important classes such as IDP polytopes (Hofscheier et al., 2016). These directions indicate that integrality in spanning problems is not a peripheral regularity condition: it is a source of structure, complexity, and algebraic rigidity across combinatorics, optimization, and geometry.