--- title: Extended Edge Elimination (EEE) url: https://www.emergentmind.com/topics/extended-edge-elimination-eee type: topic --- # Extended Edge Elimination (EEE) Extended Edge Elimination (EEE) denotes two distinct edge-centered constructions that appear in the literature under closely related names. In graph polynomial theory, the extended edge-elimination polynomial, written as $\xi(G;x,y,z)$ or $E(G;x,y,z)$, is the unique graph invariant defined by deletion, contraction, and extraction recurrences; it is described as the most general linear deletion–contraction–extraction polynomial and has specializations including Tutte-type, matching, covered-components, and bivariate chromatic polynomials [0801.1600]. In combinatorial optimization, Extended Edge Elimination is a preprocessing method for symmetric TSP instances that removes edges provably absent from every optimum tour by combining 2-opt incompatibility, 3-opt arguments, potential-point geometry, close-point rules, and depth-limited backtracking [1402.7301]. ## 1. Recurrence framework for the graph polynomial In the graph-polynomial literature, the object is defined on finite undirected graphs, with loops and multiple edges allowed in the universal formulation. The three edge operations are deletion, contraction, and extraction. For an edge $e=uv$, deletion produces $G-e$, contraction produces $G/e$, and extraction produces the graph obtained by deleting $e$, deleting both endpoints, and deleting all incident edges. Different sources write extraction as $G\Uparrow e$, $G_{\dagger e}$, or $G_{(e)}$; these are notational variants of the same elimination pattern [1205.2205]. The recurrence is $$ \xi(G;x,y,z)=\xi(G-e;x,y,z)+y\,\xi(G/e;x,y,z)+z\,\xi(G\Uparrow e;x,y,z). $$ Equivalent formulations use $E(G;x,y,z)$ in place of $\xi(G;x,y,z)$ and add multiplicativity on disjoint unions: $$ E(G^1\sqcup G^2;x,y,z)=E(G^1;x,y,z)\,E(G^2;x,y,z), $$ together with the base value $E(K_1;x,y,z)=x$ [1205.2205]. The base cases may also be stated as $$ \xi(\varnothing;x,y,z)=1,\qquad \xi(nK_1;x,y,z)=x^n. $$ For paths, this becomes $\xi(P_0;x,y,z)=1$ and $\xi(P_1;x,y,z)=x$ [1403.0969]. The supplied sources state that these axioms determine the invariant uniquely and that the result is independent of the choice of eliminated edge. A common source of ambiguity is terminological rather than mathematical: the acronym “EEE” is used both for this polynomial and for the TSP preprocessing method discussed below. ## 2. Equivalent expansions and principal specializations Two global expansions are emphasized for the polynomial formulation. The first is a subgraph-enumeration expansion via $$ H(G;v,x,y)=\sum_{H=(W,F)\subseteq G} v^{|W|}\,x^{k(H)}\,y^{|F|}, $$ where the sum ranges over vertex-edge-subgraphs and $k(H)$ is the number of connected components. The exact change of variables recorded in the literature is $$ H(G;v,x,y)=v^{|V|}\,E\!\Bigl(G;X=\tfrac{1+vx}{v},y,Z=-\tfrac{y}{v}\Bigr), $$ and $$ E(G;x,y,z)=(x-y)^{|V|}\,H\!\Bigl(G;v=\tfrac1{x-y},x=y,y=\tfrac{z}{x-y}\Bigr). $$ Substituting into the vertex-edge expansion of $H$ yields $$ E(G;x,y,z)=\sum_{H\subseteq G}(x-y)^{|V|-|W|-|F|}\,y^{k(H)}\,z^{|F|}. $$ The second is a coloring-enumeration expansion through the trivariate chromatic polynomial $\tilde P(G;x,y,z)$, which also satisfies a recurrence of type $(R1)$–$(R3)$ and is linked to $E$ by explicit substitutions [1205.2205]. Several specializations are central. Setting $z=0$ gives $$ \xi(G;x,y,0)=\sum_{A\subseteq E}x^{k(A)}\,y^{|A|}=C(G;x,y), $$ the generating function of spanning subgraphs by number of components and edges. The ordinary Tutte polynomial is then recovered by the stated change of variables $$ T(G;X,Y)=(X-1)^{-k(G)}(Y-1)^{-|V|}\,C\!\bigl(G;(X-1)(Y-1),Y-1\bigr). $$ The bivariate chromatic polynomial of Dohmen–Pönitz–Tittmann is obtained as $$ P(G;x,y)=\xi(G;x,-1,x-y). $$ The bivariate matching polynomial is $$ \mu(G;x,y)=\xi(G;x,0,y), $$ and the covered-components polynomial is $$ C_{\mathrm{cover}}(G;x,y,z)=\xi(G;x,y,xyz-xy). $$ These substitutions show why the polynomial is presented as a simultaneous generalization of several classical graph polynomials [0801.1600]. This also suggests an interpretive division of labor among the variables: the exposition of the universal edge-elimination polynomial states that $x$ tracks surviving isolated vertices, $y$ tracks contractions of edges, and $z$ tracks deletions of edges plus their endpoints [1403.0969]. ## 3. Closed forms for paths and cycles For the $n$-vertex path $P_n$, the recurrence specializes to a second-order homogeneous linear recurrence: $$ a_0=1,\qquad a_1=x,\qquad a_n=(x+y)a_{n-1}+z\,a_{n-2}\quad (n\ge 2), $$ where $a_n=\xi(P_n;x,y,z)$. Its characteristic equation is $$ r^2-(x+y)r-z=0, $$ with discriminant $$ D=(x+y)^2+4z=x^2+2xy+y^2+4z. $$ Writing $$ r_1=\tfrac12[(x+y)+\sqrt D],\qquad r_2=\tfrac12[(x+y)-\sqrt D], $$ the closed form for $D>0$ is $$ \xi(P_n;x,y,z)=\frac{\sqrt D+x-y}{2\sqrt D}\left[\frac{x+y+\sqrt D}{2}\right]^n +\frac{\sqrt D-x+y}{2\sqrt D}\left[\frac{x+y-\sqrt D}{2}\right]^n. $$ The same source also gives the $D<0$ trigonometric form and the double-root case $D=0$ [1403.0969]. A combinatorial binomial-sum expansion is recorded as $$ \xi(P_n;x,y,z)=\sum_{j=0}^{\lfloor n/2\rfloor}\binom{n-j}{j}(x+y)^{n-2j}z^j. $$ For trees, a simpler formula holds: for an $n$-vertex tree, $$ \xi(\text{$n$-vertex tree};x,y,z)=x\,(x+y)^{n-1}. $$ The tree formula is derived in the thickening paper by induction using the fact that every edge of a tree is a bridge [0801.1600]. For the cycle $C_n$, the recurrence becomes $$ \xi(C_n;x,y,z)=\xi(P_n;x,y,z)+y\,\xi(C_{n-1};x,y,z)+z\,\xi(P_{n-2};x,y,z)\qquad (n\ge 3). $$ Substituting the path solution yields the compact expression $$ \xi(C_n;x,y,z)=r_1^n+r_2^n+y^{n-1}(xy-y+z). $$ Equivalently, for $D>0$, $$ \xi(C_n;x,y,z)=\left[\frac{x+y+\sqrt D}{2}\right]^n+\left[\frac{x+y-\sqrt D}{2}\right]^n+y^{n-1}(xy-y+z). $$ The cycle inherits the two geometric terms from the path, but the literature explicitly identifies the extra term $y^{n-1}(xy-y+z)$ as a non-homogeneous “closing-term” created by the last edge on the cycle [1403.0969]. Ordinary generating functions are also known: $$ P(t)=\sum_{n=0}^\infty \xi(P_n;x,y,z)t^n=\frac{1-yt}{1-(x+y)t-zt^2}, $$ and $$ C(t)=\sum_{n=0}^\infty \xi(C_n;x,y,z)t^n =\frac{1+zt^2}{1-(x+y)t-zt^2}+\frac{(xy-y+z)t}{1-yt}. $$ ## 4. Thickening of edges and complexity of evaluation A major structural identity concerns $k$-thickening. If $G_k$ is obtained from $G$ by replacing each edge by $k$ parallel copies, then in the auxiliary $\psi$-form one has $$ \psi(G_k;x,y,z)=\psi\bigl(G;x,(1+y)^k-1,z\bigr). $$ Translating back to the original variables gives the boxed identity $$ \xi(G_k;x,y,z)=\xi\!\Bigl(G;x,(1+y)^k-1,\;z\,\frac{(1+y)^k-1}{y}\Bigr). $$ The proof proceeds through an auxiliary polynomial $$ \psi(G;x,(y_e)_{e\in E},z)= \sum_{(A\sqcup B)\subseteq E}x^{k(A\cup B)} \Bigl(\prod_{e\in A\cup B}y_e\Bigr)z^{\mathrm{cov}(B)}, $$ followed by a local doubling-edge calculation showing that doubling an edge replaces $y_e$ by $(1+y_{e_1})(1+y_{e_2})-1$ [0801.1600]. This thickening identity is then combined with a point-to-point reduction from the bivariate chromatic polynomial to obtain a broad hardness statement. The paper states that for every rational triple $(x,y,z)$ satisfying - $x\neq 0$, - $z\neq -xy$, - $(x,z)\notin \{(1,0),(2,0)\}$, - $y\notin \{-2,-1,0\}$, computing $\xi(G;x,y,z)$ from $G$ is \#P-hard. It is then summarized as intractability outside a certain two-dimensional exceptional set in $\mathbb Q^3$ [0801.1600]. The same identity is already informative at the level of examples. For a single edge $K_2$, thickening to a $k$-fold multiedge reduces evaluation to $$ \xi(G_k;x,y,z)=\xi\!\Bigl(K_2;x,(1+y)^k-1,\;z\frac{(1+y)^k-1}{y}\Bigr), $$ which expresses the multiedge instance through an ordinary edge. This suggests why thickening is effective both as an algebraic transformation and as a complexity-theoretic reduction device. ## 5. Reconstructibility and encoded graph structure The polynomial has nontrivial structural consequences beyond evaluation formulas. For simple graphs with at least three vertices, the extended edge-elimination polynomial is reconstructible from its polynomial deck: $$ D_E(G)=\{E(G-v;x,y,z)\mid v\in V\}. $$ The reconstructibility theorem is stated as follows: if $G$ is a simple graph with $|V|\ge 3$, then $E(G;x,y,z)$ is determined by the multiset $\{E(G-v;x,y,z)\mid v\in V\}$ [1205.2205]. The proof strategy uses the equivalent subgraph counting polynomial $H(G;v,x,y)$. Kelly’s lemma is applied to show reconstructibility of $H$, and the invertible transformation between $H$ and $E$ then transfers the result. In this sense, the recurrence-defined invariant is not merely computable recursively; it can also be recovered from vertex-deleted data. A second structural theorem extracts the degree sequence through the coloring form $\tilde P$. If $d(G,i)$ denotes the number of vertices of degree $i$, then $$ d(G,i)=\bigl[v^1z^{|E|-i}\bigr]\,\tilde P(G;v+1,1,z), $$ where $|E|=\deg_z(\tilde P(G;v+1,1,z))$. The proof sketch given in the source interprets $\tilde P(G;v+1,1,z)$ so that exactly one vertex is colored from a palette of size $v+1$, all remaining vertices are forced to the single proper color, and the exponent of $z$ counts edges not incident to the uniquely colored vertex. The coefficient extraction therefore recovers the degree statistics [1205.2205]. Worked examples confirm the recurrence and the summation forms. For the one-edge graph $K_2$, $$ E(K_2;x,y,z)=x^2+yx+z. $$ For the 3-vertex path $P_3$, $$ E(P_3;x,y,z)=x^3+2yx^2+(y^2+2z)x+2yz. $$ The sources state that both the subgraph-sum expansion and the coloring-sum expansion reproduce the latter expression exactly. ## 6. Extended Edge Elimination for symmetric TSP instances In the TSP literature, Extended Edge Elimination is not a graph polynomial but a preprocessing procedure on a complete graph TSP instance $(V,E,l)$. An edge is called *useless* if it belongs to no optimum tour. EEE returns a subset $E'\subseteq E$ containing all optimum tours’ edges by repeatedly applying elimination rules that extend basic pairwise incompatibility to triples of edges, potential-point geometry, and shallow search [1402.7301]. The basic pairwise incompatibility rule is the familiar 2-opt test. If $$ \max\{l(pr)+l(qs),\,l(ps)+l(qr)\}0, $$ and $$ l(pq)-l(rs)+\min_{x\in R_1}(l(rx)-l(px))+\min_{w\in S_2}(l(sw)-l(qw))>0, $$ then $pq$ is useless. The proof sketch is explicitly 3-opt: in any tour containing $pq$, the $r$- and $s$-neighbors must lie in opposite cones, so one of two specific 3-opt moves strictly shortens the tour [1402.7301]. Close-point elimination reduces the need for two potential points. Let $$ R=\{x:rx\in E,\;pq\sim rx\}. $$ If for all $x,y\in R\setminus\{p,q\}$, $$ l(xy)+l(pr)+l(qr)\max\{\alpha_p,\alpha_q\}, $$ where $$ \gamma_r=\arccos\!\Bigl(1-\frac{(l_p+l_q-l(pq)+\frac12)^2}{2\delta_r^2}\Bigr), $$ and $$ \alpha_p=2\arccos\frac{l_q^2-\delta_r^2-|qr|^2}{2\delta_r|qr|},\qquad \alpha_q=2\arccos\frac{l_p^2-\delta_r^2-|pr|^2}{2\delta_r|pr|}. $$ If these hold, then in any optimum tour through $pq$ the two $r$-neighbors cannot both lie in the same cone. The algorithmic organization is a three-stage loop over edges: a fast main-theorem elimination using strongly potential points, close-point elimination on the resulting small candidate list, and depth-limited backtracking with maximum depth $10$. With a 2-d-tree and precomputed $\delta$-values, the main part of the algorithm is analyzed as $O(n^2\log n)$ for an $n$-vertex TSP instance [1402.7301]. The same source records both exact and empirical consequences. The abstract states that by combining the approach with Concorde, a large TSPLIB instance can be solved “more than 11 times faster than Concorde alone.” The detailed notes attribute this to Hougardy–Schroeder and state that TSPLIB instances of size up to $2{,}100$ saw an $11\times$ speed-up in total CPU time when Concorde was given only the pruned edge-set $E'$. The paper also states that edges can be eliminated independently, so the method “parallelises perfectly on $O(n^2)$ tasks” [1402.7301]. A common misconception is to treat the TSP method and the graph polynomial as variants of one framework. The supplied literature supports a narrower conclusion: they share the phrase “edge elimination,” but one is a recurrence-defined graph invariant and the other is a family of geometric and combinatorial pruning rules for optimum tours. Source: https://www.emergentmind.com/topics/extended-edge-elimination-eee