---
title: Eulerian Digraph & Definition with Implications
url: https://www.emergentmind.com/topics/eulerian-digraph
type: topic
---

# Eulerian Digraph & Definition with Implications

An **Eulerian digraph** is a directed graph in which every vertex has equal in-degree and out-degree and whose relevant non-isolated part is connected in the appropriate sense. For a vertex \(v\), write \(d^+(v)\) and \(d^-(v)\) for its out-degree and in-degree. The balance condition is
\[
d^+(v)=d^-(v)\qquad\text{for every }v.
\]
For finite digraphs, Euler’s directed theorem identifies this condition together with weak connectivity of the underlying undirected graph with the existence of a directed Euler circuit: a closed directed trail traversing every arc exactly once. Equivalently, an Eulerian digraph is strongly connected and its arc set can be partitioned into arc-disjoint directed cycles. Conventions vary: some works use “Eulerian” for balance alone, allowing disconnected unions of Eulerian components, whereas others include connectivity explicitly [1011.2963; 1101.4283; 2101.11601].

## 1. Definitions and fundamental structure

A digraph \(\vec G\) is **balanced** when
\[
\deg^+(v)=\deg^-(v)
\]
at every vertex. A balanced digraph is \(k\)-regular if every vertex has out-degree \(k\); if it has \(n\) vertices, then it has \(e=kn\) arcs and its underlying undirected graph is \(2k\)-regular. Loops contribute one to both in-degree and out-degree. In every digraph,
\[
\sum_{v}\deg^+(v)=\sum_{v}\deg^-(v)=e.
\]

The directed Euler theorem gives the equivalence
\[
\begin{array}{ll}
\vec G\text{ has a directed Euler circuit};\\
\vec G\text{ is weakly connected and balanced};\\
\vec G\text{ is strongly connected and its arc set is partitionable into directed cycles}.
\end{array}
\]
Weak connectivity refers to connectivity after orientations are ignored. Strong connectivity means that every ordered pair of vertices is joined by a directed path. Thus strong connectivity alone is insufficient: a strongly connected digraph with unequal in- and out-degrees need not be Eulerian. Conversely, in a balanced digraph, weak connectivity forces strong connectivity on the non-isolated part.

The balance condition implies the cut identity
\[
e(X,V\setminus X)=e(V\setminus X,X)
\]
for every vertex set \(X\). The number of arcs leaving \(X\) equals the number entering \(X\), because internal arcs contribute equally to the in-degree and out-degree sums over \(X\). This identity is central in structural, extremal, embedding, and algorithmic arguments.

Every Eulerian digraph admits an arc-disjoint directed-cycle decomposition. Directed variants of Fleury’s algorithm construct Euler circuits, while the BEST theorem counts them. In a \(2\)-regular Eulerian digraph, an Euler circuit can be encoded by a chord diagram: each vertex occurs twice on the circuit, and two vertices are interlaced when their occurrences alternate. The associated interlace graph changes by graph pivoting under transpositions of Euler circuits; its interlace polynomial determines circuit-partition enumerators [1011.2963].

A useful parameter is
\[
t=e-n.
\]
In the toric construction associated with an Eulerian digraph, \(t+1\) is the complex dimension of the resulting affine toric Calabi–Yau variety, while its defining lattice polytope lies in \(\mathbb R^t\) [1011.2963].

## 2. Elementary operations and decompositions

Finite Eulerian digraphs admit a structure theory based on four elementary operations:

1. loop addition;
2. subdivision of an arc;
3. contraction of an undirected simple arc;
4. simple immersion, the reverse of an appropriate vertex-splitting operation.

**Loop addition** adds a loop at a vertex. Since a loop contributes one to both degrees, balance and Eulerianity are preserved:
\[
(n,e)\longmapsto(n,e+1),\qquad t\longmapsto t+1.
\]

**Subdivision** replaces an arc \(v\to w\) by
\[
v\to x\to w.
\]
The new vertex has in-degree and out-degree one, and
\[
(n,e)\longmapsto(n+1,e+1),
\]
so \(t\) is unchanged. Subdivision of a loop produces a directed \(2\)-cycle.

**Contraction of an undirected simple arc** identifies the endpoints of an arc whose underlying undirected edge is the only edge between them. It preserves balance and changes
\[
(n,e)\longmapsto(n-1,e-1).
\]
The simplicity requirement prevents the contraction from creating a loop in the loopless class.

**Splitting** a vertex of out-degree two separates its incoming and outgoing arc ends into two balanced groups. It changes
\[
(n,e)\longmapsto(n-1,e-2),\qquad t\longmapsto t-1.
\]
The reverse operation is a **simple immersion**; it introduces a new \(2\)-regular vertex and replaces two arcs by four arcs.

Every finite Eulerian digraph can be generated from the one-vertex graph with no arcs by iterating these four operations. Loopless smooth representatives are obtained by removing loops and smoothing degree-two vertices. For fixed \(t\), every loopless smooth Eulerian digraph is obtainable from a loopless smooth \(2\)-regular Eulerian digraph by contracting undirected simple arcs. The \(2\)-regular class is generated from a family of obstruction digraphs \(\vec O_p\) by simple immersion.

The distinction between **immersion** and other containment relations is important. An immersion maps vertices injectively and replaces each arc by a directed path, with the paths pairwise edge-disjoint; internal vertices may be shared. A strong immersion additionally forbids branch vertices from occurring internally on immersion paths. Immersion is weaker than subdivision, which generally requires internal vertex-disjointness, and differs from a minor relation based on vertex and edge contraction [2108.13959; 2509.26260].

## 3. Quivers, toric Calabi–Yau varieties, and chip-firing

An Eulerian digraph naturally defines an abelian quiver gauge theory. Associate a gauge factor \(U(1)\) to each vertex and a bifundamental field to each arc. The incidence matrix \(Q_{ia}\) assigns \(+1\) to the head of arc \(a\), \(-1\) to its tail, and \(0\) elsewhere. Its column sums vanish:
\[
\sum_i Q_{ia}=0.
\]
For an Eulerian digraph, balance is exactly the row condition
\[
\sum_a Q_{ia}=0\qquad\text{for every }i.
\]
This is the quiver anomaly-cancellation condition.

For a weakly connected digraph, the diagonal \(U(1)\) lies in the kernel, leaving an effective gauge group
\[
U(1)^{n-1}.
\]
Choose lattice vectors \(\boldsymbol\nu_a\in\mathbb Z^{e-n+1}\) satisfying
\[
\sum_a Q_{ia}\boldsymbol\nu_a=\boldsymbol 0.
\]
The cone generated by these vectors defines an affine toric variety of complex dimension
\[
e-n+1=t+1.
\]
Because the row sums of \(Q\) vanish, there is an integral vector \(\boldsymbol\eta\) such that
\[
\langle\boldsymbol\eta,\boldsymbol\nu_a\rangle=1
\]
for every arc. Hence all generators lie in a common characteristic hyperplane, the canonical bundle is trivial, and
\[
c_1(\mathcal M_{\vec G})=0.
\]
The associated lattice polytope \(\Delta_{\vec G}\subset\mathbb R^{e-n}\) is the convex hull of the projected generators.

The four graph operations have corresponding polytope transformations. Loop addition produces a pyramid and increases the toric dimension by one. Subdivision leaves the generating set, polytope, and toric variety unchanged. Contraction deletes the lattice point corresponding to the contracted arc and corresponds physically to Higgsing a relative \(U(1)\). Simple immersion increases the dimension by one and produces a Cayley polytope. In special cases, the resulting polytopes include Lawrence prisms, joins of simplices, and products of independent unit squares. Distinct Eulerian quivers can define the same toric Calabi–Yau geometry, reflecting toric duality and, physically, Seiberg duality [1011.2963].

Eulerianity also governs chip-firing. After choosing a sink \(s\), deleting arcs leaving \(s\) produces a digraph with a global sink. Recurrent configurations form the sandpile group, whose order is
\[
\det\Delta^{(s)},
\]
the number of spanning arborescences oriented toward \(s\). For Eulerian digraphs, the appropriately shifted generating function of recurrent configurations is independent of the sink:
\[
T_G(y)=\sum_{c\in\mathcal C}y^{\operatorname{level}(c)}.
\]
It specializes to the undirected partial Tutte polynomial \(T_G(1,y)\), and
\[
T_G(1)=\det\Delta^{(s)}.
\]
The sink-independence theorem depends on the Eulerian burning criterion and on the maximum-chip property of recurrent configurations [1306.0294].

## 4. Extremal properties and long directed structures

Eulerian balance imposes strong restrictions on feedback arc sets and directed cycles. If a simple Eulerian digraph has \(n\) vertices and \(m\) arcs, its minimum feedback arc set has size
\[
\beta(G)\ge \frac{m^2}{2n^2}+\frac{m}{2n}.
\]
This is optimal for infinitely many pairs \((m,n)\), including suitable Cayley digraphs. The feedback bound implies the short-cycle estimate
\[
g(G)\le \frac{6n^2}{m},
\]
where \(g(G)\) is the directed girth. It also yields an Eulerian subgraph \(H\) with minimum degree
\[
\delta(H)\ge \frac{m^2}{24n^3}.
\]
These estimates are tight up to constant factors [1202.2602].

The same framework gives long-cycle lower bounds. Every Eulerian digraph with \(n\) vertices and \(m\) arcs contains a directed cycle of length at least
\[
1+\max\left\{\frac{m^2}{24n^3},\left\lfloor\sqrt{\frac mn}\right\rfloor\right\}.
\]
A later result improved the general square-root estimate: if the average out-degree is \(d=m/n\), then the circumference satisfies
\[
\ell(D)\ge \sqrt{2d}-\frac32.
\]
The proof uses a final spanning out-branching. Its levels are independent, arcs from upper levels to lower levels are forced to be back arcs, and the Eulerian cut identity bounds forward arcs by
\[
\frac{nt(t+1)}2
\]
when \(t\) is the maximum cycle length. Combining forward and back arcs yields the stated inequality [2510.26426].

For directed paths, a stronger exponent is known. Every connected Eulerian digraph of average degree at least \(d\) contains, from every prescribed starting vertex, a simple directed path of length
\[
\Omega\!\left(d^{1/2+1/40}\right).
\]
The proof combines \(d\)-full Eulerian subgraphs, robust strong connectivity after deleting small vertex sets, random path selection, shortcutting through high-degree vertices, and Eulerian-preserving replacement of two-edge paths by fake edges [2101.11601].

A further density theorem establishes an oriented analogue of the Erdős–Sós phenomenon. If an Eulerian digraph with \(n\) vertices and \(m\) arcs satisfies
\[
m>(t-1)n,
\]
then it contains every oriented tree with \(t\) edges. The threshold is sharp: a disjoint union of complete bidirected graphs on \(t\) vertices has equality and contains no oriented tree with \(t\) edges. Quantitatively, the number of embeddings of any such tree is at least
\[
t\bigl(m-(t-1)n\bigr).
\]
The proof uses permutation prefixes, balanced-prefix inequalities, prefix gluing, and induction on the oriented tree [2609.10987].

Minimum directed degree also forces dense immersions. There is an absolute constant \(\alpha>0\) such that
\[
\delta^+(G)\ge \alpha t
\]
in an Eulerian digraph implies an immersion of the complete digraph \(K_t\). The proof extracts robust bidirectional expansion, routes many edge-disjoint paths, and converts a dense Eulerian multidigraph into a complete-digraph immersion. Eulerian cut balance is essential: without it, large in- and out-degree does not force even a \(K_3\)-immersion [2108.13959].

## 5. Algorithms and parameterized problems

The **Eulerian Extension** problem asks whether arcs of total weight at most a threshold can be added to a directed multigraph so that the result is Eulerian. Added arcs must simultaneously repair degree imbalances and connect components. The problem is NP-hard. If \(k\) is the number of added arcs, it can be solved in
\[
O(4^k n^4)
\]
time. Parameterizing by the number \(c\) of connected components and the total positive imbalance
\[
b=\sum_{v:\,\operatorname{balance}(v)>0}
\bigl(\operatorname{indeg}(v)-\operatorname{outdeg}(v)\bigr),
\]
the problem admits an algorithm with running time
\[
O\!\left(
4^{c\log(bc^2)}\,n^2(b^2+n\log n)+n^2m
\right).
\]
A matching reformulation, Conjoining Bipartite Matching, represents imbalance correction by perfect matching and connectivity by conjoining constraints. Fixed-parameter tractability for the component parameter alone remains open, and no polynomial-size kernel is expected for parameters \(k\), \(b\), \(c\), or \((b,c)\) unless \(coNP\subseteq NP/\mathrm{poly}\) [1101.4283].

A related problem, **Eulerian Strong Component Arc Deletion**, deletes a minimum number of arcs so that every remaining strongly connected component is internally Eulerian. This is weaker than making the entire digraph Eulerian: arcs between different strongly connected components are ignored in the internal balance equations. The problem is W[1]-hard parameterized by the deletion budget, para-NP-hard parameterized by maximum degree, and W[1]-hard parameterized by the vertex-cover number. It is in XP parameterized by treewidth and is FPT parameterized by treewidth plus maximum degree or by treewidth plus solution size. The problem remains NP-hard even when degree pairs belong to
\[
\{(1,6),(6,1)\}
\]
[1106.4454; 2408.13819].

For semicomplete digraphs, spanning Eulerian subdigraphs behave more regularly. Every \(2\)-arc-strong semicomplete digraph has a spanning Eulerian subdigraph containing any prescribed arc, one avoiding any prescribed arc, and a spanning trail between every ordered pair of distinct vertices. For \(k\) prescribed arcs, \((k+1)\)-arc-strongness is conjectured to suffice for avoidance; the proved general upper bound is
\[
f(k)\le \frac{(k+1)^2}{4}+1,
\]
while \(f(k)\ge k+1\), and equality is proved for \(k\le3\) and for prescribed arc sets forming forests of stars [1905.11019].

Spectral methods provide separation bounds for connected Eulerian digraphs whose out-degree Laplacian
\[
L=\Delta^+-A
\]
is normal. If \(Y,Z\) are disjoint and no arc goes from \(Z\) to \(Y\), then the sizes of \(Y\) and \(Z\) are bounded in terms of the complex Laplacian eigenvalues. The proof uses a symmetric block dilation of a shifted Laplacian and eigenvalue interlacing. The normality hypothesis is restrictive but includes Cayley digraphs of abelian groups and regular tournaments [1511.03317].

## 6. Embeddings, topology, and enumerative theory

A directed embedding is one in which incoming and outgoing half-arcs alternate around every vertex; equivalently, every facial boundary follows arc directions. A connected Eulerian digraph always admits an orientable directed embedding. A **bi-Eulerian embedding** has exactly two faces, each bounded by a directed Euler circuit.

For quartic Eulerian digraphs, diplanarity means an embedding in the plane with alternating local orientations. Cycle removal followed by suppression defines a partial order under which diplanarity is hereditary. Minimal non-diplanar obstructions have no loops, at most two undirected edges between any pair of vertices, are \(4\)-edge-connected, and are strongly \(2\)-edge-connected. Obstructions with digons are generated from digon-free obstructions by admissible vertex splitting and digon insertion. Known families include doubled directed cycles, directed Möbius ladders, anti-ladders, cyclic block families, \(\overrightarrow K_{2,2,2}\), and \(\overrightarrow K_{4,4}\). A complete obstruction classification remains open [1706.02896].

Degree modulo four controls orientable bi-Eulerian embeddings. If every vertex of an Eulerian digraph has total degree \(2\pmod4\), then any prescribed directed Euler circuit can bound one face of an orientable bi-Eulerian embedding. If exactly two vertices have degree \(0\pmod4\), the same conclusion holds when those vertices are interlaced along the prescribed circuit. More generally, if \(\ell\) vertices have degree \(0\pmod4\), there is an orientable directed embedding with one prescribed face and at most \(\ell+1\) additional faces, yielding orientable genus at least
\[
\frac{m-n-\ell}{2}.
\]
Every nontrivial Eulerian digraph also has a one-face nonorientable directed embedding, giving maximum Euler genus \(m-n+1\) [2404.00325].

For sufficiently dense underlying simple graphs, the orientable embedding problem becomes sharper. If
\[
\delta(\operatorname{usg}(D))\ge \frac{4n+2}{5}
\]
and \(C\) is any prescribed directed circuit decomposition, then \(D\) has an oriented directed embedding in which the circuits of \(C\) are profaces and the number of additional antifaces is exactly one or two, according to the parity of
\[
n+|A(D)|+|C|.
\]
This embedding has maximum orientable genus relative to the prescribed circuits. For a specified Euler circuit \(T\), the parity condition \(n+|A(D)|\equiv0\pmod2\) yields a bi-Eulerian embedding with \(T\) as one face [2409.14531].

Eulerian digraphs also support several enumerative correspondences. Dyck words are in bijection with a restricted family of ordered, cycle-labelled Eulerian multidigraphs through **Dyck matrices**. Matrix rows represent directed cycles, columns represent vertices, and the row-transition rules encode controlled intersections of consecutive cycles. The bijection transfers Catalan enumeration to these cycle-matrix structures [1407.2461].

In chip-firing, the sink-independent polynomial \(T_G(y)\) extends the partial Tutte specialization. In circuit enumeration, if \(\mathfrak C_t(D)\) denotes partitions of Eulerian circuits into \(t\) circuits, then every connected Eulerian digraph other than a single directed cycle satisfies
\[
\sum_{t\ge1}(-1)^t|\mathfrak C_t(D)|=0.
\]
The proof uses the refinement semilattice of connected Eulerian edge partitions, heaps of directed cycles, unique-sink orientations of cycle-intersection graphs, bond-lattice Möbius inversion, and NBC theory. The cancellation yields an application to the classical Harary–Sachs theorem for graphs [2502.00867].

Finally, Eulerian digraphs provide overlap graphs for universal cycles. Allowed words, lattice paths, random walks, monotone words, Lipschitz words, augmented-onto functions, and cyclic-category words become arcs of a shift-overlap digraph. If the overlap digraph is weakly connected and balanced, its Euler circuit is a universal cycle containing every allowed object exactly once as a cyclic block [1711.07029]. This illustrates the central role of Eulerian balance: it converts local extension compatibility into a global cyclic enumeration.

Source: https://www.emergentmind.com/topics/eulerian-digraph