Fourientations and the Tutte polynomial
 Spencer Backman^{1} and
 Sam Hopkins^{2}Email author
https://doi.org/10.1186/s406870170107z
© The Author(s) 2017
Received: 23 August 2016
Accepted: 12 April 2017
Published: 12 September 2017
Abstract
Keywords
1 Background
Throughout we use graph to mean finite, undirected graph (although we allow loops and multiple edges). The Tutte polynomial is the most general Tutte–Grothendieck invariant one can associate to a graph; that is, any graph invariant that satisfies a deletion–contraction recurrence is a specialization of the Tutte polynomial. In fact, any graph invariant that satisfies a weighted deletion–contraction recurrence is essentially an evaluation of the Tutte polynomial, as the following theorem, which is sometimes called the recipe theorem, makes precise.
Theorem 1.1
In light of Theorem 1.1, we call an expression of the form \(a^{n\kappa }b^{g}T_G(x,y)\) a generalized Tutte polynomial evaluation. Note that \(n\kappa \) is the rank of the graphic matroid associated with G and g is its corank. In what follows we assume for simplicity that all graphs are connected. We also write \(T(x,y) :=T_G(x,y)\) when the graph is implicit.
Our aim in this paper is to systematically exploit Theorem 1.1 in order to enumerate various classes of generalized graph orientations via the Tutte polynomial. A fourientation of a graph is a choice for each edge whether to orient that edge in either direction, leave it unoriented, or biorient it. (There are \(4^{E(G)}\) fourientations of a graph G and thus the name.) A (k, l, m)fourientation is obtained from a fourientation by assigning each oriented edge one of k colors, each unoriented edge one of l colors, and each bioriented edge one of m colors. A potential cut (cycle) in a fourientation is the same as a directed cut (cycle) in an ordinary total orientation except that some of the edges may be unoriented (bioriented). In Sect. 2, we generate a list of potential cut and cycle properties which mix with one another to give an intersection lattice of 64 cut–cycle properties of (k, l, m)fourientations such that each associated class is enumerated by a generalized Tutte polynomial evaluation. Moreover, we show that our list of properties is exhaustive: we derive the axioms required for our deletion–contraction proof to apply and show that the set of properties satisfying these axioms consists of precisely the potential cut and cycle properties on our list together with two exceptional cases. In Sect. 3, we consider specializations of (k, l, m) that recover enumerative results about classes of partial orientations and total orientations obtained by many authors, as detailed in Sect. 1.1.
Our axiomatic approach to orientation properties recovers classes of partial orientations which arose in seemingly unrelated contexts and also suggests interesting new avenues of research. In Sect. 4, we outline how several of our cut and cycle properties relate to geometric, combinatorial, and algebraic objects including bigraphical hyperplane arrangements, cycle–cocycle reversal systems, graphic Lawrence ideals, divisors on graphs, zonotopal algebra, and the reliability polynomial. Recent developments in the study of divisors on graphs, including the commutative algebra of the Abelian sandpile model [24, 44, 52–54], Riemann–Roch theory for graphs [5, 7], and geometrizations of the MatrixTree theorem [1], highlight the algebraic significance of the relationship between graph orientations and their indegree sequences. The partial orientation classes we define, which we term minedge classes, appear to arise in many situations where one is interested in indegree sequences. A striking example of this phenomenon, described in detail in Sect. 4.4, is that the acycliccut positively connected partial orientations point the way toward a monomization of the internal power ideal associated with a graph G. While there exist constructions of monomizations of the external [22, 56] and central [55] power ideal associated with G, there is no such construction for the internal power ideal that works for all G. We arrived at the definition of the minedge class cut positively connected only as a result of our abstract machinery, but it conjecturally helps resolve this outstanding problem that we became aware of after we began our research.
1.1 History
Since at least the seminal work of Stanley [60], it has been known that the Tutte polynomial counts classes of graph orientations defined in terms of cuts and cycles. Stanley [60] proved that the number of acyclic orientations of a graph is T(2, 0), which is also equal to the chromatic polynomial evaluated at \(1\). Las Vergnas [40] proved that the number of strongly connected orientations, those with no directed cut, is T(0, 2). Greene and Zaslavsky [32] showed that the number of acyclic orientations of a graph with a unique source q is T(1, 0). By fixing a total order on the edges and a reference orientation of the graph, the previous result can be generalized in the following way: the number of acyclic orientations such that the minimum edge in each directed cut is oriented as in the reference orientation is T(1, 0). These orientations give distinguished representatives for the set of acyclic orientations modulo cut reversals, which can be obtained greedily. Gioan [27] observed that T(0, 1) counts the number of equivalence classes of strongly connected orientations modulo directed cycle reversals, or equivalently indegree sequences of strongly connected orientations (because any two orientations with the same indegree sequence differ by cycle reversals). This theorem is equivalent to the result of Greene and Zaslavsky [32] that the number of strongly connected orientations for which the minimum edge in any directed cycle is oriented as in the reference orientation is T(0, 1) since these orientations give distinguished representatives for the set of strongly connected orientations modulo cycle reversals. Greene and Zaslavaky’s result and its equivalence to Gioan’s result were rediscovered by Chen et al. [15] who investigated it from a bijective perspective. Stanley [62] observed that the total number of indegree sequences among orientations is counted by T(2, 1), which may be interpreted as a version of the previous result for orientations that are not necessarily strongly connected. Similarly, Gioan [27] proved that the number of (not necessarily acyclic) qconnected orientations is T(1, 2), and the number of indegree sequences of these orientations is T(1, 1). Trivially, \(T(0,0)=0\), the number of strongly connectedacyclic orientations, and \(T(2,2)= 2^{E}\), the total number of orientations. Putting all of these enumerations together, Gioan [27] offered a unified framework for interpretations of T(x, y) for all integer values \(0 \le x,y \le 2\) in terms of equivalence classes of orientations. He presented separate proofs for the evaluations where either x or y is zero and then obtained the remaining nonzero evaluations via a convolution formula for the Tutte polynomial due to Kook et al. [39]. Gioan later provided a more unified proof [28] making use of matroid duality, while still requiring application of the convolution formula and separate proofs for the evaluations T(2, 0) and T(1, 0).
Gessel and Sagan [26] used depthfirst search to investigate relationships between the Tutte polynomial and partial orientations (which they call “suborientations”) and fourientations (which they call “subdigraphs”) of a graph. They proved that two generating functions for generalized orientations give generalized Tutte polynomial evaluations with the following specializations: the number of acyclic partial orientations of a graph is \(2^gT(3,1/2)\), the number of qconnected fourientations is \(2^{E}T(1,2)\), and the number of acyclic, qconnected partial orientations of a graph is \(2^gT(1,1/2)\). The first result was rediscovered and proven via deletion–contraction by the first author [4], who also showed that the number of strongly connected partial orientations is \(2^{n1}T(1/2,3)\). It was also shown in [4] that the number of partial orientations modulo cut reversals and modulo cycle reversals are \(2^{n1}T(1,3)\) and \(2^{g}T(3,1)\), respectively. As in the case of total orientations, the partial orientations for which the minimum edge in every directed cut or cycle is oriented in the same direction as the reference orientation give distinguished representatives for these equivalence classes. The second author and Perkinson [35] observed that the number of regions of a generic bigraphical arrangement is \(2^{n1}T(3/2,1)\) and the number of bounded regions is \(2^{n1}T(1/2,1)\). They demonstrated that the regions of a bigraphical arrangement are labeled by a certain class of “admissible” acyclic partial orientations. Using exponential parameters to define a generic arrangement, we give an alternate description of these admissible partial orientations as those for which the minimum edge in any potential cycle is neutral. The partial orientations that label bounded regions become those which are in addition strongly connected.
By specializing (k, l, m) in our main Theorem 2.14 to (1, 1, 1) (fourientations), (1, 1, 0) (type A classes of partial orientations), (1, 0, 1) (type B classes of partial orientations), and (1, 0, 0) (total orientations), we obtain tables (see Fig. 4) in which all of the aforementioned results appear as entries. Moreover, for \((k,l,m) = (1,0,0)\), our proof of Theorem 2.14 specializes to a uniform proof of the Tutte polynomial evaluations in Gioan’s \(3 \times 3\) square of total orientation classes. Another uniform proof of the Tutte polynomial evaluations in this \(3 \times 3\) square can be obtained from a certain orientation activity expansion of the Tutte polynomial due to Las Vergnas [42] which is closely related to the “active bijection” of Gioan–Las Vergnas [29]. We explore this orientation activity approach in a sequel paper with Traldi [6]; see Sect. 3.5 for more details.
2 Fourientations and minedge classes
2.1 Notation and terminology
In this section, we introduce, enumerate, and classify the main objects of study in this article: minedge classes of fourientations. In order to do so, we begin by first developing some useful notation and terminology, which will be employed throughout the paper.
Let G be a graph. We use V(G) to denote the vertex set of G and E(G) to denote its edge set. Recall that throughout we will assume that all graphs are connected. (This assumption is justified by the fact that if \(G = G' \sqcup G''\) is the disjoint union of two other graphs then we have \(T_G(x,y) = T_{G'}(x,y) \cdot T_{G''}(x,y)\).) We take a moment to describe our notation for the edges of G and for orientations of these edges. Formally, V(G) is some finite set and E(G) is a finite set together with a map \(\varphi (G) :E(G) \rightarrow \left( \left( \genfrac{}{}{0.0pt}{}{V(G)}{2}\right) \right) \), i.e., a map \(\varphi (G)\) from E(G) to the set of all multisets of V(G) of size two. By abuse of notation, for an edge \(e \in E(G)\) we write \(e = \{u,v\}\) to mean \(\varphi (G)(e) = \{u,v\}\); however, note that we may have \(e,f \in E\) with \(e = \{u,v\}\) and \(f=\{u,v\}\) but \(e \ne f\), meaning that e and f are multiple edges between the same vertices; it is also possible that \(e = \{u,u\}\) is a loop. In order to talk about orientations of a graph, it is helpful to have a reference orientation. A reference orientation \(\mathcal {O}_{\mathrm {ref}}\) of G is a map \(\mathcal {O}_{\mathrm {ref}}:E(G) \rightarrow V(G)\times V(G)\) with \(F \circ \mathcal {O}_{\mathrm {ref}}= \varphi (G)\) where \(F:V(G) \times V(G) \rightarrow \left( \left( \genfrac{}{}{0.0pt}{}{V}{2}\right) \right) \) is the forgetful map. An orientation of \(e \in E(G)\) is a formal symbol \(e^{+}\) or \(e^{}\), where we think of \(e^{+}\) as the orientation of e that agrees with \(\mathcal {O}_{\mathrm {ref}}\) and \(e^{}\) as the orientation that disagrees with \(\mathcal {O}_{\mathrm {ref}}\). For \(\delta , \varepsilon \in \{+,\}\) we define \(\delta \) and \(\delta \cdot \varepsilon \) in the obvious way. When discussing orientations we use the symbols ± and \(\mp \) for compactness of notation: any mathematical sentence involving ± should be interpreted by replacing all occurrences of ± with \(\delta \), all occurrences of \(\mp \) with \(\delta \), and adding “for \(\delta \in \{,+\}\)” at the end of the sentence. Let \(\mathbb {E}(G) :=\{e^{\pm }:e \in E(G)\}\) be the set of orientations of edges of G. We extend \(\mathcal {O}_{\mathrm {ref}}\) to a map \(\mathbb {E}(G) \rightarrow V(G) \times V(G)\) by setting \(\mathcal {O}_{\mathrm {ref}}(e^{+}) :=\mathcal {O}_{\mathrm {ref}}(e) \hbox { and } \mathcal {O}_{\mathrm {ref}}(e^{}) :=\mathcal {O}_{\mathrm {ref}}(e)^{\mathrm {op}}\), where \((u,v)^{\mathrm {op}} :=(v,u)\). Again abusing notation, we write \(e^{\pm } = (u,v)\) to mean \(\mathcal {O}_{\mathrm {ref}}(e^{\pm }) = (u,v)\); however, note that if \(e = \{u,u\}\) is a loop then \(e^{+} = (u,u)\) and \(e^{} = (u,u)\) but we still treat \(e^{+}\) and \(e^{}\) as different orientations of e. We call the pair \((G,\mathcal {O}_{\mathrm {ref}})\) an oriented graph.
Definition 2.1
A fourientation \(\mathcal {O}\) of an oriented graph \((G,\mathcal {O}_{\mathrm {ref}})\) is a subset of \(\mathbb {E}(G)\).
In other words, a fourientation is a choice for each edge e of a subset of \(\{e^{+},e^{}\}\). If \(e^{+},e^{} \in \mathcal {O}\) then we say e is bioriented in \(\mathcal {O}\), and if \(e^{+},e^{} \notin \mathcal {O}\) then we say e is unoriented in \(\mathcal {O}\). An oriented edge e of \(\mathcal {O}\) is one for which \(e^{\pm } \in \mathcal {O}\) but \(e^{\mp } \notin \mathcal {O}\). We emphasize that \(\mathcal {O}_{\mathrm {ref}}\) is not essential in the definition of a fourientation but \(\mathcal {O}_{\mathrm {ref}}\) has allowed us to introduce the very useful notation \(e^+\) and \(e^\) which we employ throughout this paper. Moreover, when we discuss the properties of cuts and cycles in fourientations which define classes enumerated by generalized Tutte polynomial evaluations the reference orientation will play an indispensable role. Fourientations were introduced and studied in an enumerative context by Gessel and Sagan [26] under the name of “subdigraphs.” They are also superficially similar to the orientations of signed graphs investigated by Zaslavsky [69], but note that Zaslavsky’s notion of a cycle in a signed graph orientation is quite different from the kinds of cycles of fourientations we investigate. It seems plausible that there is some deeper connection between orientations of signed graphs and fourientations and it would be very interesting to find such a relationship.
We now need to review cuts and cycles of graphs as these are fundamental in defining properties of orientations. A cut of G is a partition \({Cu}= \{U,U^c\}\) for some \(U \subseteq V(G)\), where \(U^{c} :=V(G) {\setminus } U\) denotes the complement of U, such that both U and \(U^{c}\) are nonempty. We define \(E({Cu}) :=\{e = \{u,v\}:u \in U, v\in U^{c}, e \in E(G)\}\). The cut \({Cu}\) is simple if the restriction of G to U and the restriction of G to \(U^{c}\) both remain connected. (What we call simple cuts are often called “bonds.”) An edge \(e \in E(G)\) is an isthmus if \(E({Cu}) = \{e\}\) for some (necessarily simple) cut \({Cu}\). A cycle of G is a list \({Cy}= v_1, e_1, v_2, e_2, \ldots , v_k, e_k\) with \(k \ge 1, v_i \in V(G), e_i \in E(G)\), up to rotation and reflection of the indices, such that all edges \(e_i\) are distinct and \(e_i = \{v_i, v_{i+1 \mod k}\}\). We define \(E({Cy}) :=\{e_i:1 \le i \le k\}\). The cycle \({Cy}\) is simple if all the \(v_i\) are distinct. Note that an edge \(e \in E(G)\) is a loop if and only if \(E({Cy}) = \{e\}\) for some (necessarily simple) cycle \({Cy}\).
Remark 2.2
Cuts and cycles in graphs are dual to one another; this duality is made precise through the theory of matroids which we will not review here. Consequently, almost all statements we make about cuts have an analog for cycles. In order to save space, we therefore heavily employ the format “... cut (cycle) ...,” which should always be interpreted as two assertions: one about cuts and one about cycles.
A directed cut of \((G,\mathcal {O}_{\mathrm {ref}})\) is an ordered pair \(\overrightarrow{{Cu}}= (U,U^c)\) for some cut \({Cu}= \{U,U^c\} \hbox { of } G\); let \(E(\overrightarrow{{Cu}}) :=E({Cu})\) and \(\mathbb {E}(\overrightarrow{{Cu}}) :=\{e^{\pm } = (u,v):u \in U, v\in U^{c}, e \in E(G)\}\); i.e., \(\mathbb {E}(\overrightarrow{{Cu}})\) is the set of edge orientations from U to \(U^c\). A directed cycle of \((G,\mathcal {O}_{\mathrm {ref}})\) is a list \(\overrightarrow{{Cy}}= v_1,e^{\delta _1}_1,\ldots ,v_k,e^{\delta _k}_k\), with \(\delta _i \in \{+,\}\), up to rotation but not reflection of indices, for some cycle \({Cy}= v_1,e_1,\ldots ,v_k,e_k\) of G such that \(e^{\delta _i}_i = (v_i,v_{i+1 \mod k});\hbox { let }E(\overrightarrow{{Cy}}) :=E({Cy})\) and \(\mathbb {E}(\overrightarrow{{Cy}}) :=\{e^{\delta _i}_i:1 \le i \le k\}\). Note that each cut (cycle) \({C}\) has two associated directed cuts (cycles) \(\overrightarrow{{C}}\) and \(\overrightarrow{{C}}\).
Definition 2.3
A potential cut (cycle) in a fourientation is the same as a directed cut (cycle) in an ordinary total orientation except that some of the edges may be unoriented (bioriented). More formally, a potential cut (cycle) of a fourientation is a directed cut (cycle) of the oriented graph such that each edge in that cut (cycle) is either oriented in agreement with the cut (cycle) or is unoriented (bioriented). In symbols, \(\overrightarrow{{Cu}}\) is a potential cut belonging to some larger fourientation \(\mathcal {O}\) if \(e^{\pm } \in \mathbb {E}(\overrightarrow{{Cu}}) \Rightarrow e^{\mp } \notin \mathcal {O}\) for all \(e \in E\), and \(\overrightarrow{{Cy}}\) is a potential cycle of \(\mathcal {O}\) if \(e^{\pm } \in \mathbb {E}(\overrightarrow{{Cy}}) \Rightarrow e^{\pm } \in \mathcal {O}\) for all \(e \in E\).
Example 2.4
Here \(\mathcal {O}= \{e_2^{+},e_2^{},e_3^{+},e_4^{+},e_4^{},e_5^{+},e_6^{},e_7^{+}\}\) (where the \(+\) on \(e_7\) in \(\mathcal {O}\) is used to denote that \(e_7^+ \in \mathcal {O}\) as opposed to \(e_7^{} \in \mathcal {O}\)). Observe that \(\overrightarrow{{Cu}}= (\{v_2\},\{v_1,v_3,v_4,v_5\})\) is a potential cut of \(\mathcal {O}\) and \(\overrightarrow{{Cy}}= v_1,e_2^{+},v_3,e_4^{+},v_4,e_5^{+},v_5,e_6^{}\) is a potential cycle of \(\mathcal {O}\).
In this section, we define various classes of fourientations of \((G,\mathcal {O}_{\mathrm {ref}})\) in terms of potential cuts and cycles. We will need more input data to define these classes. Specifically, we will also need <, a total order on the edges of G. Such an edge order often appears in investigations of the Tutte polynomial because it allows one to define the (internal and external) activity of spanning trees of a graph. It may be possible to extend our work to allow for other notions of activity; for instance, see the recent paper [19] which develops a unified perspective for various kinds of activity. However, we will stick to the most classical case of activity defined in terms of a total edge order here. We call the triple \(\mathbb {G}= (G,\mathcal {O}_{\mathrm {ref}},<)\) an ordered, oriented graph. A fourientation of \(\mathbb {G}\) is of course a fourientation of the underlying oriented graph \((G,\mathcal {O}_{\mathrm {ref}})\).
As an aside, we note that by contracting all the bioriented edges and deleting all the unoriented edges in a fourientation we obtain a total orientation of a graph minor. This procedure seems quite natural as potential cuts and cycles are mapped to directed cuts and cycles, respectively. Unfortunately, in order to reverse this procedure we must remember how the oriented graph minor was obtained (i.e., which edges were contracted and which were deleted) because various fourientations may be mapped to the same oriented graph minor.
A fundamental notion for graph orientations is that of reachability by directed paths. In an ordinary total orientation \(\mathcal {O}\) we say that the vertex v is reachable from the vertex u if we can walk from u to v along a series of edges that are oriented in \(\mathcal {O}\) consistently with our walk. Because we are viewing a bioriented edge as the union of both orientations of an edge, we will allow a bioriented edge to be traversed in either direction. On the other hand, unoriented edges cannot be traversed in either direction. Thus, we define a potential path P of a fourientation \(\mathcal {O}\) of \((G,\mathcal {O}_{\mathrm {ref}})\) to be a list \(v_1,e^{\delta _i}_1,\ldots ,e^{\delta _{k1}}_{k1},v_k\) for some \(k \ge 1\) such that the \(e_i\) are distinct, \(e^{\delta _i}_i = (v_i,v_{i+1})\), and \(e^{\delta _i} \in \mathcal {O}\) for all \(1 \le i \le k\). We say that P is a potential path from \(v_1\) to \(v_k\), and we set \(E(P) :=\{e_i:1 \le i \le k1\}\). If there is a potential path P of \(\mathcal {O}\) from u to v, then we say v is reachable from u in \(\mathcal {O}\). It is a classical fact, which can be seen by considering reachability classes, that every edge in a total orientation belongs to a directed cycle or a directed cut but not both. It remains the case in fourientations that every oriented edge belongs to either a potential cut or potential cycle but not both, as we show in Proposition 2.6. First we present a more basic lemma that says that potential cuts and cycles of a fourientation are disjoint.
Lemma 2.5
Let \(\mathcal {O}\) be a fourientation of \((G,\mathcal {O}_{\mathrm {ref}})\). Let \(\overrightarrow{{Cu}}\) be a potential cut of \(\mathcal {O}\) and \(\overrightarrow{{Cy}}\) a potential cycle of \(\mathcal {O}\). Then \(E(\overrightarrow{{Cu}}) \cap E(\overrightarrow{{Cy}}) = \varnothing \).
Proof
Certainly if e is bioriented in \(\mathcal {O}\) then it does not belong to a potential cut and if e is unoriented in \(\mathcal {O}\) then it does not belong to a potential cycle. So suppose that \(e^{\pm } = (u,v) \in \mathcal {O}\) but \(e^{\mp } \notin \mathcal {O}\) and let \(\overrightarrow{{Cu}}= (U,U^c)\) be a potential cut of \(\mathcal {O}\) with \(e \in E(\overrightarrow{{Cu}})\). Note that u is not reachable from v because any potential path from v to u would have to go through an edge in \(E(U,U^c)\) and these are all either unoriented or oriented from U into \(U^c\). Thus, there is no potential cycle \(\overrightarrow{{Cy}}\) of \(\mathcal {O}\) with \(e \in E(\overrightarrow{{Cy}})\). \(\square \)
Proposition 2.6
Let \(\mathcal {O}\) be a fourientation of \((G,\mathcal {O}_{\mathrm {ref}})\) and e an oriented edge of \(\mathcal {O}\). Then \(e \in E(\overrightarrow{{Cu}})\) for some potential cut \(\overrightarrow{{Cu}}\) of \(\mathcal {O}\) or \(e \in E(\overrightarrow{{Cy}})\) for some potential cycle \(\overrightarrow{{Cy}}\) of \(\mathcal {O}\) but not both.
Proof
Let \(e^{\pm } = (u,v) \in \mathcal {O}\) with \(e^{\mp } \notin \mathcal {O}\). Let U be set of vertices reachable from v in \(\mathcal {O}\). If \(u \in U\) then e belongs to a potential cycle. Otherwise \((U,U^c)\) is a potential cut containing e. By Lemma 2.5 we know that \(e^{\pm }\) cannot belong to both a potential cut and a potential cycle. \(\square \)
In general, we cannot partition all of the edges of a fourientation into potential cuts and cycles. However, the following two propositions offer two dual ways to extend the partition of the oriented edges in Proposition 2.6 to a decomposition of the entire edge set of our graph.
Proposition 2.7
 (a)
for any \(e \in E_{\mathrm {cu}}(\mathcal {O})\) we have \(e \in E(\overrightarrow{{Cu}})\) for some potential cut \(\overrightarrow{{Cu}}\) of \(\mathcal {O}/ E^c_{\mathrm {cu}}(\mathcal {O})\);
 (b)
there is no \(e \in E^c_{\mathrm {cu}}(\mathcal {O})\) with \(e \in E(\overrightarrow{{Cu}})\) for any potential cut \(\overrightarrow{{Cu}}\) of \(\mathcal {O}{\setminus } E_{\mathrm {cu}}(\mathcal {O})\).
Proposition 2.8
 (a)
for any \(e \in E_{\mathrm {cy}}(\mathcal {O})\) we have \(e \in E(\overrightarrow{{Cy}})\) for some potential cycle \(\overrightarrow{{Cy}}\) of \(\mathcal {O}{\setminus } E^c_{\mathrm {cy}}(\mathcal {O})\);
 (b)
there is no \(e \in E^c_{\mathrm {cy}}(\mathcal {O})\) with \(e \in E(\overrightarrow{{Cy}})\) for any potential cycle \(\overrightarrow{{Cy}}\) of \(\mathcal {O}/ E_{\mathrm {cy}}(\mathcal {O})\).
Proof of Proposition 2.7 We first show existence. Let \(E_{\mathrm {cu}}(\mathcal {O})\) be the set of edges which belong to a potential cut of \(\mathcal {O}\) and \(E^c_{\mathrm {cu}}(\mathcal {O})\) the complement of this set. Clearly condition (a) is satisfied. To show (b), let \(e \in E^c_{\mathrm {cu}}(\mathcal {O})\). If e is bioriented in \(\mathcal {O}\) then certainly it does not belong to a potential cut of \(\mathcal {O}/ E_{\mathrm {cy}}(\mathcal {O})\). Next suppose e is oriented in \(\mathcal {O}\). Then since e does not belong to a potential cut of \(\mathcal {O}\), by Proposition 2.7 it belongs to a potential cycle \(\overrightarrow{{Cy}}\) of \(\mathcal {O}\). Note that \(E(\overrightarrow{{Cy}}) \cap E_{\mathrm {cu}}(\mathcal {O}) = \varnothing \) by Lemma 2.5. Thus \(\overrightarrow{{Cy}}\) persists as a potential cycle in \(\mathcal {O}/ E_{\mathrm {cy}}(\mathcal {O})\), so again by Lemma 2.5 we have that e belongs to no potential cycle. Finally, suppose that \(e = \{u,v\}\) is unoriented in \(\mathcal {O}\). Note that because e does not belong to a potential cut, there is a potential path P from u to v and another potential path \(P'\) from v to u. All of the edges in \(E(P) \cup E(P')\) either belong to potential cycles or are bioriented; at any rate, none of them belong to potential cuts. Thus, P and \(P'\) persist as potential paths in \(\mathcal {O}/ E_{\mathrm {cy}}(\mathcal {O})\). Finally, note that the paths P and \(P'\) prevent e from belonging to any potential cut of \(\mathcal {O}/ E_{\mathrm {cy}}(\mathcal {O})\). So indeed regardless of how e is fouriented it does not belong to any potential cut of \(\mathcal {O}/ E_{\mathrm {cy}}(\mathcal {O})\).
For proving uniqueness of this decomposition, suppose \(E(G) = A\sqcup B\) and every edge of G / B belongs to a potential cut of \(\mathcal {O}/ B\) while no edges of \(G {\setminus } A\) belong to a potential cut of \(\mathcal {O}{\setminus } A\). First suppose that there exits some \(e \in A {\setminus } E_{\mathrm {cu}}(\mathcal {O})\). We know that e does not belong to a potential cut in \(\mathcal {O}\); hence, it certainly does not belong to a potential cut in \(\mathcal {O}/B\), which is a contradiction. Therefore, we may assume that \(A\subseteq E_{\mathrm {cu}}(\mathcal {O})\) and \(E^c_{\mathrm {cu}}(\mathcal {O}) \subseteq B\). Next suppose there is some edge in \(e \in B {\setminus } E^c_{\mathrm {cu}}(\mathcal {O})\). We know that e belongs to a potential cut in \(\mathcal {O}\), and therefore, e belongs to a potential cut in \(\mathcal {O}{\setminus } A\), which is a contradiction. Thus, \(A = E_{\mathrm {cu}}(\mathcal {O})\) and \(B = E^c_{\mathrm {cu}}(\mathcal {O})\).\(\square \)
Proof of Proposition 2.8 The proof is analogous to the proof of Proposition 2.7. We define \(E_{\mathrm {cy}}(\mathcal {O})\) to be the set of edges which belong to a potential cycle. \(\square \)
2.2 Tutte fourientation properties and the main theorem
We now define Tutte fourientation properties. These properties are defined axiomatically so as to satisfy exactly those conditions necessary for us to carry out a deletion–contraction argument that invokes Theorem 1.1 and proves that they are enumerated by generalized Tutte polynomial evaluations. The key observation that motivates this definition is that if some objects associated with our graph G are enumerated by a generalized Tutte polynomial evaluation, then there is some way of recursively deleting and contracting edges of G so that at each step our enumeration respects the relevant weighted deletion–contraction recurrence. We may as well assume the order that we delete and contract is dictated by <. Thus, we force the weighted deletion–contraction recurrence to hold with respect to the maximum edge of our graph. As we will see later, we can also give explicit descriptions of these properties that focuses instead on the statuses of minimum edges in cuts and cycles.
Definition 2.9

T1 \(\mathcal {O}\) is a bad fourientation of \(\mathbb {G}\) only if \(\mathcal {O}\) has a potential cut (cycle);

T2 if the maximum edge e of \(\mathbb {G}\) is neither an isthmus nor a loop, then
 (a)
if \(\mathcal {O}\) is a good fourientation of \(\mathbb {G}{\setminus } e\) (\(\mathbb {G}/ e\)) then \(\mathcal {O}\cup \{e^{+}\}\) and \(\mathcal {O}\cup \{e^{}\}\) are both good fourientations of \(\mathbb {G}\);
 (b)
if \(\mathcal {O}\) is a bad fourientation of \(\mathbb {G}{\setminus } e (\mathbb {G}/ e)\) but \(\mathcal {O}\cup \{e^{+},e^{}\} (\mathcal {O})\) is a good fourientation of \(\mathbb {G}\), then exactly one of \(\mathcal {O}\cup \{e^{+}\}\) or \(\mathcal {O}\cup \{e^{}\}\) is a good fourientation of \(\mathbb {G}\);
 (c)
\(\mathcal {O}\) is a good fourientation of \(\mathbb {G}{\setminus } e (\mathbb {G}/ e)\) if and only if \(\mathcal {O}(\mathcal {O}\cup \{e^{+},e^{}\})\) is a good fourientation of \(\mathbb {G}\).
 (a)
The following lemma says that condition T2(c) applies to Tutte cut–cycle properties as well as individual Tutte cut or cycle properties.
Lemma 2.10
Let e be the maximum edge of \(\mathbb {G}\), and assume e is not an isthmus or loop. Then \(\mathcal {O}\) is a good fourientation of \(\mathbb {G}{\setminus } e\) with respect to some Tutte cut–cycle property if and only if \(\mathcal {O}\) is good for \(\mathbb {G}\). Similarly, \(\mathcal {O}/ e\) is good for \(\mathbb {G}/e\) if and only if \(\mathcal {O}\cup \{e^{+},e^{}\}\) is good for \(\mathbb {G}\).
Proof
Suppose \(\mathcal {O}\) is bad for \(\mathbb {G}{\setminus } e\) with respect to the cycle property: then there is a simple cycle \({Cy}\) of \(\mathbb {G}{\setminus } e\) so that \(\mathcal {O}_{{Cy}}\) is bad for the cycle property; this cycle \({Cy}\) persists in \(\mathbb {G}\) and in fact \(\mathbb {G}_{{Cy}}\) is isomorphic to \((\mathbb {G}{\setminus } e)_{{Cy}}\); therefore, \(\mathcal {O}\) is also bad for \(\mathbb {G}\). Similarly, if \(\mathcal {O}\) is bad for \(\mathbb {G}\) with respect to the cycle property and \(e^{+},e^{} \notin \mathcal {O}\), then there is a simple cycle \({Cy}\) of \(\mathbb {G}\) so that \(\mathcal {O}_{{Cy}}\) is bad for the cycle property. If we had \(e \in E({Cy})\), then \(\mathcal {O}_{{Cy}}\) could not have a potential cycle and so could not be bad by condition T1. So indeed \(e \notin E({Cy})\), and thus \({Cy}\) remains a simple cycle of \(\mathbb {G}{\setminus } e\), and thus \(\mathcal {O}\) remains bad for \(\mathbb {G}{\setminus } e\). On the other hand, that \(\mathcal {O}\) is bad for \(\mathbb {G}{\setminus } e\) with respect to the cut property if and only if \(\mathcal {O}\) is bad for \(\mathbb {G}\) is exactly condition T2(c). The proof for \(\mathbb {G}/e\) is analogous. \(\square \)
Lemma 2.11
Let e be the maximum edge of \(\mathbb {G}\) and let \(\mathcal {O}\) be a good fourientation of \(\mathbb {G}\) with respect to some Tutte cut–cycle property. Then either \(\mathcal {O}{\setminus } e\) is good for \(\mathbb {G}{\setminus } e\) or \(\mathcal {O}/ e\) is good for \(\mathbb {G}/ e\).
Proof
If e is an isthmus or loop, then \(\mathcal {O}{\setminus } e\) and \(\mathcal {O}/e\) are both clearly good. So assume that e is neither an isthmus nor a loop. By Lemma 2.10, if e is unoriented in \(\mathcal {O}\) then \(\mathcal {O}{\setminus } e\) is good and if e is bioriented in \(\mathcal {O}\) then \(\mathcal {O}/e\) is good. So assume further that \(e^{\delta } \in \mathcal {O}\) and \(e^{\delta } \notin \mathcal {O}\) for some \(\delta \in \{+,\}\). Now suppose to the contrary that both \(\mathcal {O}{\setminus } e\) and \(\mathcal {O}/e\) are bad. Note as in the proof of Lemma 2.10 that \(\mathcal {O}{\setminus } e\) is certainly good for \(\mathbb {G}{\setminus } e\) with respect to the cycle property; \(\mathcal {O}/e\) is certainly good for \(\mathbb {G}/e\) with respect to the cut property. So \(\mathcal {O}{\setminus } e\) is bad with respect to the cut property and \(\mathcal {O}/e\) is bad with respect to the cycle property. Then by condition T2(b) we can extend \(\mathcal {O}{\setminus } e\) to a bad fourientation of \(\mathbb {G}\) with respect to the cut property by orienting e in a certain direction, and it must be that \(\mathcal {O}' :=(\mathcal {O}{\setminus } e) \cup \{e^{\delta }\}\) is this extension as we know \(\mathcal {O}\) is good. Analogously we know that \(\mathcal {O}' = (\mathcal {O}/ e) \cup \{e^{\delta }\}\) is bad for \(\mathbb {G}\) with respect to the cycle property. But that means that there must be some cut \({Cu}\) of \(\mathbb {G}\) so that \(\mathcal {O}'_{{Cu}}\) is bad with respect to the cut property. It must be that \(e \in E({Cu})\) or else \(\mathcal {O}_{{Cu}}\) would also be bad. And it must be that there is a way of directing \({Cu}\) to become a potential cut \(\overrightarrow{{Cu}}\) of \(\mathcal {O}'\) or else the contraction \(\mathcal {O}'_{{Cu}}\) could not be bad by condition T1. Analogously we can find a potential cycle \(\overrightarrow{{Cy}}\) of \(\mathcal {O}'\) with \(e \in E(\overrightarrow{{Cy}})\). However, this contradicts Lemma 2.5 which says the edge sets of potential cuts and potential cycles are disjoint. \(\square \)
The deletion–contraction argument we use to count the good fourientations with respect to some Tutte cut–cycle property will actually work for fourientations that are weighted by the number of oriented, bioriented, and unoriented edges they contain. Thus, we define the following chromatic extension of fourientations.
Definition 2.12
For \(k, l, m \in \mathbb {Z}_{\ge 0}\), a (k,l,m)fourientation is obtained from a fourientation by assigning each of the oriented edges one of k colors, each of the unoriented edges one of l colors, and each of the bioriented edges one of m colors. If a variable is set equal to zero, we naturally require that the associated fourientations have no edges with the corresponding fourientation type. We say a (k, l, m)fourientation is good with respect to a fourientation property if the underlying fourientation is good.
Definition 2.13
We define the bad isthmus set \(X \subseteq \{ \varnothing , \{\}, \{+\}\}\) of a Tutte cut property in the following way: let \((B_1,\mathcal {O}_{\mathrm {ref}},<)\) be the unique (up to isomorphism) ordered, oriented graph whose underlying graph is the banana graph \(B_1\) and let e denote the unique edge of \(B_1\); define X to be the set of all S such that \(\{e^{\varepsilon }:\varepsilon \in S\}\) is a bad fourientation for \((B_1,\mathcal {O}_{\mathrm {ref}},<)\) with respect to the cut property. (Observe that by T1 it is impossible for \(\{e^{+},e^{}\}\) to be bad with respect to a Tutte cut property.) For a Tutte cycle property we define its bad loop set \(Y \subseteq \{ \{\}, \{+\},\{,+\}\}\) analogously in terms of the fourientations that are bad for \(C_1\). The bad isthmus (loop) set of a Tutte cut–cycle property is the bad isthmus (loop) set of its underlying cut (cycle) property.
Theorem 2.14
Proof
Let G be a graph and set \(\mathbb {G}:=(G,\mathcal {O}_{\mathrm {ref}},<)\) for arbitrary \(\mathcal {O}_{\mathrm {ref}}\) and <. If G has no edges, then certainly \(f(G) = 1\). So assume G has an edge and let e be the maximum edge of \(\mathbb {G}\). If e is an isthmus, then the simple cycles of G are the same as those of \(G{\setminus } e\) and there is one additional simple cut: namely, the cut that has e as its only edge. So any good fourientation \(\mathcal {O}\) of \(\mathbb {G}{\setminus } e\) extends to a good fourientation \(\mathcal {O}\cup \{e^{\varepsilon }:\epsilon \in S\}\) of \(\mathbb {G}\) as long as \(S \notin X\), and we get all good fourientations of \(\mathbb {G}\) this way. Therefore, if e is an isthmus then \(f(G) = x_0 f(G{\setminus } e)\). Similarly if e is a loop then \(f(G) = y_0f(G/e)\). So from now on assume that e is neither an isthmus nor loop.
 (i)
either \(De(\mathcal {O}) \subseteq De {\setminus } Co\) and \(De(\mathcal {O}) = \{\mathcal {O}, \mathcal {O}\cup \{e^{\varepsilon }\}\}\) for some \(\varepsilon \in \{,+\}\);
 (ii)
or \(De(\mathcal {O}) \subseteq De \cap Co\) and \(De(\mathcal {O}) = \{\mathcal {O}, \mathcal {O}\cup \{e^\mathrm {+}\}, \mathcal {O}\cup \{e^\mathrm {}\}, \mathcal {O}\cup \{e^{+},e^{}\}\}\).
Remark 2.15
Theorem 2.14 says that there are the same number of good fourientations of \((G,\mathcal {O}_{\mathrm {ref}}^1,<^1)\) and \((G,\mathcal {O}_{\mathrm {ref}}^2,<^2)\) with respect to some fixed Tutte cut–cycle property. It would be interesting to find a simple bijection between these sets of fourientations; that is, it would be interesting to understand how the set of good fourientations changes as we modify the reference orientation and total order.
2.3 Minedge classes
A priori it is not clear that there are any nontrivial Tutte cut properties. We will now show that there exist Tutte cut properties for all bad isthmus sets \(X \subseteq \{ \varnothing , \{+\}, \{\}\}\). Moreover, we will show that the Tutte cut properties are almost classified by X (specifically, for each choice of X there are one, two, or three Tutte cut properties with bad isthmus set X). Of course the situation is analogous for Tutte cycle properties.
Definition 2.16
 (i)
\(\{\varepsilon :e_{\mathrm {min}}^{\varepsilon } \in \mathcal {O}\} = S\) for some \(S \in X\), where \(e_{\mathrm {min}}\) is the minimum edge in \(E(\overrightarrow{{C}})\) ;
 (ii)
if \(e_{\mathrm {min}}\) is unoriented (bioriented) in \(\mathcal {O}\) then \(e_{\mathrm {min}}^{\delta } \in \mathbb {E}(\overrightarrow{{C}})\).
A heuristic explanation for the emphasis on the statuses of minimum edges in potential cuts is that in checking whether a cut is good or bad with respect to a Tutte cut property we repeatedly peel off maximal edges until we reduce to the base case where the cut’s minimum edge becomes an isthmus. The point of \(\delta \) is that in order to satisfy T2(b) we want one of the ways of extending a bad cut by an oriented edge to be bad and the other way to be good: if the bad cut consists only of unoriented edges then both ways of extending it by an oriented edge still yield potential cuts and so could potentially be bad by T1; in this case \(\delta \) tells us which of these in fact is bad.
 (1)
Cut general (\(X = \varnothing \)): There are no restrictions on potential cuts.
 (2)
Cut directed (\(X = \{\varnothing \}\)): For each potential cut, if the minimum edge of the cut is unoriented then the cut contains some oriented edge directed in agreement with the reference orientation of this minimum edge.
 (3)
Cut negative (\(X = \{ \{\} \} \)): The minimum edge in each potential cut is unoriented or is oriented in agreement with its reference orientation.
 (4)
Cut positive (\(X = \{\{+\}\} \)): The minimum edge in each potential cut is unoriented or is oriented in disagreement with its reference orientation.
 (5)
Cut connected (\(X = \{\varnothing ,\{\}\}\)): Each potential cut contains an oriented edge directed in agreement with the reference orientation of the minimum edge in the cut.
 (6)
Cut coconnected (\(X = \{\varnothing ,\{+\}\}\)): For each potential cut, either the minimum edge of the cut is unoriented and the cut contains an oriented edge directed in agreement with the reference orientation of this minimum edge, or the minimum edge is oriented in disagreement its the reference orientation.
 (7)
Cut neutral (\(X = \{\{\},\{+\}\}\)): The minimum edge in each potential cut is unoriented.
 (8)
Cut positively connected (\(X = \{\varnothing ,\{\},\{+\}\}\)): The minimum edge in each potential cut is unoriented, and the cut contains an oriented edge directed in agreement with the reference orientation of this minimum edge.
Theorem 2.17
Any minedge cut (cycle) property is a Tutte cut (cycle) property.
Proof
The least obvious condition is T2(b). First of all, if \(\mathcal {O}\) is bad for \(\mathbb {G}{\setminus } e\) then one of \(\mathcal {O}\cup \{e^{+}\}\) or \(\mathcal {O}\cup \{e^{}\}\) is bad because \(\mathbb {G}{\setminus } e\) has at least one bad potential cut and so if we orient e as \(e^{\pm }\) in a way consistent with this cut it will remain a bad potential cut in \(\mathcal {O}\cup \{e^{\pm }\}\). In order to complete the proof that T2(b) holds, we claim that if \(\mathcal {O}\cup \{e^{+},e^{}\}\) is good for \(\mathbb {G}\) then at least one of \(\mathcal {O}\cup \{e^{+}\}\) or \(\mathcal {O}\cup \{e^{}\}\) is good. Suppose that to the contrary \(\mathcal {O}\cup \{e^{+},e^{}\}\) is good but \(\mathcal {O}\cup \{e^{+}\}\) and \(\mathcal {O}\cup \{e^{}\}\) are both bad. Since \(\mathcal {O}\cup \{e^{+},e^{}\}\) is good, it cannot be that there is a bad potential cut \(\overrightarrow{{Cu}}\) of \(\mathcal {O}\cup \{e^{\pm }\}\) with \(e \notin E(\overrightarrow{{Cu}})\). So it must be that there is a bad potential cut \(\overrightarrow{{Cu}}_{+} = (U_{+},U_{+}^c)\) of \(\mathcal {O}\cup \{e^{+}\}\) and a bad potential cut \(\overrightarrow{{Cu}}_{} = (U_{},U_{}^c)\) of \(\mathcal {O}\cup \{e^{}\}\) with \(e \in E(\overrightarrow{{Cu}}_{+}) \cap E(\overrightarrow{{Cu}}_{})\). The idea, as depicted in Fig. 1, is to glue the cuts \(\overrightarrow{{Cu}}_{+}\) and \(\overrightarrow{{Cu}}_{}\) together to find a bad potential cut which does not involve e. Let \(e_{\mathrm {min}}\) be the minimum edge of \(E(\overrightarrow{{Cu}}_{+}) \cup E(\overrightarrow{{Cu}}_{})\). By supposition that e is not an isthmus, we have \(e \ne e_{\mathrm {min}}\). Suppose by symmetry that \(e_{\mathrm {min}}^{\delta } \in \mathbb {E}(\overrightarrow{{Cu}}_{+})\) for some \(\delta \in \{+,\}\). We claim that \(e_{\mathrm {min}}^{\delta } \ne (u,v)\) with \(u \in U_{+} \cap U_{}^{c}\) and \(v \in U_{+}^{c} \cap U_{}\). Suppose to the contrary. Then \(e_{\mathrm {min}} \in E(\overrightarrow{{Cu}}_{+}) \cap E(\overrightarrow{{Cu}}_{})\), which means that in order for \(\overrightarrow{{Cu}}_{+}\) to be a potential cut of \(\mathcal {O}\cup \{e^{+}\}\) and \(\overrightarrow{{Cu}}_{}\) a potential cut of \(\mathcal {O}\cup \{e^{}\}\) we need \(e_{\mathrm {min}}\) to be unoriented in \(\mathcal {O}\). But then we have \(e_{\mathrm {min}}^{\delta } \in \mathbb {E}(\overrightarrow{{Cu}}_{+})\) and \(e_{\mathrm {min}}^{\delta } \in \mathbb {E}(\overrightarrow{{Cu}}_{})\), so by part (ii) of the minedge cut definition we cannot have that \(\overrightarrow{{Cu}}_{+}\) and \(\overrightarrow{{Cu}}_{}\) are both bad potential cuts, a contradiction. So indeed \(e_{\mathrm {min}}^{\delta } \ne (u,v)\) for any \(u \in U_{+} \cap U_{}^{c}\) and \(v \in U_{+}^{c} \cap U_{}\). One consequence of this is that \(U_{+} \ne U_{}^{c}\). So at least one of \(U_{+} \cap U_{}\) or \(U_{+}^{c} \cap U_{}^{c}\) is nonempty. And on the other hand if \(e = \{w,x\}\) then \(\{w,x\} \subseteq (U_{+} \cap U_{})^c \cap (U_{+}^{c} \cap U_{}^{c})^c\), so \((U_{+} \cap U_{})^c\) and \((U_{+}^{c} \cap U_{}^{c})^c\) are both nonempty. Thus if we define \(\overrightarrow{{Cu}}' :=(U_{+} \cap U_{},(U_{+} \cap U_{})^c)\) and \(\overrightarrow{{Cu}}'' :=(U_{+}^{c} \cap U_{}^{c},(U_{+}^{c} \cap U_{}^{c})^c)\) at least one of these must genuinely be a directed cut. Our discussion of \(e_{\mathrm {min}}\) also establishes that \(e_{\mathrm {min}}^{\delta } \in \mathbb {E}(\overrightarrow{{Cu}}')\) or \(e_{\mathrm {min}}^{\delta } \in \mathbb {E}(\overrightarrow{{Cu}}'')\). Whichever of \(\overrightarrow{{Cu}}'\) or \(\overrightarrow{{Cu}}''\) it belongs to is a potential cut of \(\mathcal {O}\cup \{e^{+},e^{}\}\) because we have \(e \notin E(\overrightarrow{{Cu}}') \cap E(\overrightarrow{{Cu}}'')\). But then one of \(\overrightarrow{{Cu}}'\) or \(\overrightarrow{{Cu}}''\) is a bad potential cut of \(\mathcal {O}\cup \{e^{+},e^{}\}\), contradicting our assumption that \(\mathcal {O}\cup \{e^{+},e^{}\}\) is good. \(\square \)
In order to give a near converse to Theorem 2.17 and to completely classify Tutte cut properties, we need to introduce two anomalous properties: cut weird and cut coweird. The cut weird fourientations of an ordered, oriented graph are those such that each potential cut contains at least one oriented edge and the minimum oriented edge in the cut is oriented in agreement with its reference orientation. The cut coweird fourientations are those such that each potential cut contains at least one oriented edge and the minimum oriented edge in the cut is oriented in disagreement with its reference orientation.
Theorem 2.18
Any Tutte cut property is either a minedge cut property or is cut weird or cut coweird. There is a completely analogous classification for Tutte cycle properties.
Proof
Again we work with the cut case. Fix some Tutte cut property. Because it is a cut property, this property is determined by the values it takes on ordered, oriented banana graphs. It is not hard to see that if our Tutte property agrees with some minedge cut property \((X,\delta )\) on all ordered, oriented banana graphs then it agrees with \((X,\delta )\) on all graphs (here we again use the fact that a cut decomposes into simple cuts). Our goal is to find \((X,\delta )\). Clearly we should define X to be the bad isthmus set of our Tutte cut property. In order to define \(\delta \) we need to consider some small banana graphs. Let us view the banana graph \(B_n\) as having vertex set \(V(B_n) :=\{u,v\}\) and edge set \(E(B_n) :=\{e_1,\ldots ,e_n\}\) where \(e_1 :=\cdots :=e_n :=\{u,v\}\). Define the edge order < by \(e_1<\cdots < e_n\). If \(\varnothing \notin X\), then we define \(\delta \) arbitrarily. If \(\varnothing \in X\), then we define \(\delta \) as follows: define a reference orientation \(\mathcal {O}_{\mathrm {ref}}^2\) by \(\mathcal {O}_{\mathrm {ref}}^2(e^{+}_1) :=\mathcal {O}_{\mathrm {ref}}^2(e^{+}_2) :=(u,v)\); then let \(\delta \in \{+,\}\) be so that \(\mathcal {O}^2 :=\{e_2^{\delta }\}\) is a bad fourientation of \((B_2,\mathcal {O}_{\mathrm {ref}}^2,<)\). We need to check that our property agrees with the minedge cut property \((X,\delta )\) on all banana graphs. So let \((B_n,\mathcal {O}_{\mathrm {ref}},<)\) be an ordered, oriented banana graph and assume \(n > 1\) since we know our Tutte property agrees with \((X,\delta )\) for \(n=1\). Let \(\mathcal {O}\) be a fourientation of \((B_n,\mathcal {O}_{\mathrm {ref}},<)\). If \(\mathcal {O}\) has any bioriented edges, we know it is good by condition T1 because it has no potential cuts and this agrees with \((X,\delta )\). So now assume \(\mathcal {O}\) has no bioriented edges. If \(\mathcal {O}{\setminus } e_n\) is good for \((B_n,\mathcal {O}_{\mathrm {ref}},<) {\setminus } e_n\) then we know by conditions T2(a) and T2(c) that \(\mathcal {O}\) is good no matter how \(e_n\) is fouriented, which again agrees with \((X,\delta )\). If \(\mathcal {O}{\setminus } e_n\) is bad but contains at least one oriented edge, then we know by conditions T1, T2(b), and T2(c) that \(\mathcal {O}\) is good if and only if e is oriented to disagree with that oriented edge and make it so that \(\mathcal {O}\) has no potential cuts. This agrees with \((X,\delta )\). So finally assume that \(\mathcal {O}{\setminus } e_n\) is bad and contains no oriented edges. Note by repeated application of T2(c) that this is possible only if \(\varnothing \in X\). Certainly by T2(c) if \(e_n^{+},e_n^{} \notin \mathcal {O}\) then \(\mathcal {O}\) is bad; so the status of \(\mathcal {O}\) is only at issue if \(e_n^{\varepsilon } \in \mathcal {O}\) for some \(\varepsilon \in \{,+\}\). We claim that in this case the status of \(\mathcal {O}\) is still consistent with \((X,\delta )\) unless we are in an exceptional case that we will address at the end.
From now on assume \(\varnothing \in X\) (or else we cannot have that \(\mathcal {O}{\setminus } e_n = \varnothing \) is bad). Using the \(+ \leftrightarrow \) symmetry assume additionally from now on that \(\delta = \). The proof that follows is technical and requires constructing several auxiliary graphs; Figure 2 offers a pictorial aid for the various subclaims made below. We must now consider how our Tutte property behaves with respect to the other reference orientation for \(B_2\). Define \(\mathcal {O}_{\mathrm {ref}}^{2'}\) by \(\mathcal {O}_{\mathrm {ref}}^{2'}(e^{+}_1) :=\mathcal {O}_{\mathrm {ref}}^{2'}(e^{}_2) :=(u,v)\) and define \(\mathcal {O}^{2'} :=\{e_2^{+}\}\). There are two cases to address: either \(\mathcal {O}^{2'}\) is bad for \((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<)\) or it is good.
Case I: \(\mathcal {O}^{2'}\) is a bad fourientation of \((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<)\).
Note that this case is consistent with the minedge cut property defined by \((X,\delta )\). We will show that indeed our Tutte property is this minedge cut property.
Subclaim 1
Set \(\mathcal {O}_{\mathrm {ref}}^3(e^+_1) :=\mathcal {O}_{\mathrm {ref}}^3(e^_2) :=\mathcal {O}_{\mathrm {ref}}^3(e^_3) :=(u,v)\). Then \(\mathcal {O}^3 :=\{e_3^{+}\}\) is a bad fourientation of \((B_3,\mathcal {O}_{\mathrm {ref}}^3,<)\).
Proof
Suppose to the contrary. Define the auxiliary graph \(G^{*}\) by \(V(G^{*}) :=\{u,v,w\}\) and \(E(G^{*}) :=\{e_1,e_2,e_3,e_4,e_5\}\) where \(e_1 :=e_3 :=\{u,w\}\) and \(e_2 :=e_4 :=e_5 :=\{u,v\}\). Set \(\mathcal {O}_{\mathrm {ref}}^{*}(e_1^{}) :=\mathcal {O}_{\mathrm {ref}}^{*}(e_3^{+}) :=(u,w)\) and \(\mathcal {O}_{\mathrm {ref}}^{*}(e_2^{+}) :=\mathcal {O}_{\mathrm {ref}}^{*}(e_4^{}) :=\mathcal {O}_{\mathrm {ref}}^{*}(e_5^{}) :=(u,v)\). Then \(\mathcal {O}^{*} :=\{e_3^{},e_5^{+}\}\) must be good for \(\mathbb {G}^{*} :=(G^{*},\mathcal {O}_{\mathrm {ref}}^{*},<)\): the graph \(G^{*}\) has two simple cuts \({Cu}_1 :=\{ \{u,v\}, \{w\}\}\) and \({Cu}_2 :=\{ \{u,w\}, \{v\}\}\); the contraction to these cuts is \((\mathbb {G}^{*}_{{Cu}_1},\mathcal {O}^{*}_{{Cu}_1}) \simeq ((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<),\mathcal {O}^{2'})\) and \((\mathbb {G}^{*}_{{Cu}_2},\mathcal {O}^{*}_{{Cu}_2}) \simeq ((B_3,\mathcal {O}_{\mathrm {ref}}^{3},<),\mathcal {O}^3)\), both of which are good by supposition. Let \(G^{*'}\) be the graph obtained from \(G^{*}\) by adding an edge \(e_6 :=\{v,w\}\), and let \(\mathcal {O}_{\mathrm {ref}}^{*'}\) be any extension of \(\mathcal {O}_{\mathrm {ref}}^{*}\). By the Tutte condition (2c), we have that \(\mathcal {O}^{*}\) remains good for \(\mathbb {G}^{*'} :=(G^{*'},\mathcal {O}_{\mathrm {ref}}^{*'},<)\). Set \({Cu}_3 :=\{ \{u\}, \{v,w\}\}\), a cut of \(G^{*'}\). Since we are working with a cut property, we know the contraction \((\mathbb {G}^{*'}_{{Cu}_3},\mathcal {O}^{*}_{{Cu}_3})\) is good; by removing \(e_5\) and \(e_4\) from this contraction using conditions T2(a) and T2(c) we get that something isomorphic to \(((B_3,\mathcal {O}_{\mathrm {ref}}^{3},<),\mathcal {O}^3)\) is good. But \(\mathcal {O}^3\) and \(\mathcal {O}^3\) both being good for \((B_3,\mathcal {O}_{\mathrm {ref}}^{3},<)\) contradict the Tutte condition T2(b). So indeed it must have been that \(\mathcal {O}^3\) was bad. \(\square \)
Subclaim 2
Let \(n > 1\). Fix some \((B_n,\mathcal {O}_{\mathrm {ref}},<)\). Suppose \(\mathcal {O}= \{e_n^{\varepsilon }\}\) for \(\varepsilon \in \{,+\}\) with \(\mathcal {O}_{\mathrm {ref}}(e^{+}_1) = \mathcal {O}_{\mathrm {ref}}(e_n^{\varepsilon })\). Then \(\mathcal {O}\) is bad for \((B_n,\mathcal {O}_{\mathrm {ref}},<)\).
Proof
Assume without loss of generality that \(\mathcal {O}_{\mathrm {ref}}(e^{+}_1) = (u,v)\). Define a reference orientation \(\mathcal {O}_{\mathrm {ref}}^{n+3}\) of \(B_{n+3}\) by \(\mathcal {O}_{\mathrm {ref}}^{n+3}(e_1^{+}) :=\mathcal {O}_{\mathrm {ref}}^{n+3}(e_2^{}) :=\mathcal {O}_{\mathrm {ref}}^{n+3}(e_3^{}) :=(u,v)\) and \(\mathcal {O}_{\mathrm {ref}}^{n+3}(e^{+}_i) :=\mathcal {O}_{\mathrm {ref}}(e^{+}_{i3})\) for all \(4 \le i \le n+3\). Since \(\mathcal {O}^3\) is bad for \((B_3,\mathcal {O}_{\mathrm {ref}}^3,<)\), repeated use of condition T2(c) and one application of T2(b) says that \(\mathcal {O}^{*} :=\{e_3^{+},e_{n+3}^{\varepsilon }\}\) is bad for \((B_{n+3},\mathcal {O}_{\mathrm {ref}}^{n+3},<)\). Define the auxiliary graph \(G^{*}\) by \(V(G^{*}) :=\{u,v,w\}\) and \(E(G^{*}) :=\{e_1,\ldots ,e_{n+4}\}\), where \(e_1 :=e_4 :=\ldots :=e_{n+3} :=\{u,v\},~e_{n+4} :=\{v,w\}\) and \(e_2 :=e_3 :=\{u,w\}\). Let \(\mathcal {O}_{\mathrm {ref}}^{*}\) be any extension of \(\mathcal {O}_{\mathrm {ref}}^{n+3}\). Because the contraction of \(( (G^{*}, \mathcal {O}_{\mathrm {ref}}^{*},<),\mathcal {O}^{*})\) to the cut \(\{\{u\},\{v,w\}\}\) is isomorphic to \(((B_{n+3},\mathcal {O}_{\mathrm {ref}}^{n+3},<),\mathcal {O}^{*})\), we get that \(\mathcal {O}^{*}\) is bad for \(\mathbb {G}^{*} :=(G^{*}, \mathcal {O}_{\mathrm {ref}}^{*},<)\). So by condition T2(c), \(\mathcal {O}^{*}{\setminus } e_{n+4}\) is bad for \(\mathbb {G}^{*} {\setminus } e_{n+4}\). Note that \(G^{*} {\setminus } e_{n+4}\) has two simple cuts: \({Cu}_1 :=\{\{u,v\},\{w\}\}\) and \({Cu}_2 :=\{\{u,w\},\{v\}\}\). The contraction of \(( \mathbb {G}^{*} {\setminus } e_{n+4},\mathcal {O}^{*} {\setminus } e_{n+4})\) to \({Cu}_1\) is isomorphic to \(((B_2,\mathcal {O}_{\mathrm {ref}}^2,<),\mathcal {O}^2)\), which is good. So it must be that the contraction of \((\mathbb {G}^{*} {\setminus } e_{n+4},\mathcal {O}^{*} {\setminus } e_{n+4})\) to \({Cu}_2\), which is isomorphic to \(((B_n,\mathcal {O}_{\mathrm {ref}},<),\mathcal {O})\), is bad. \(\square \)
Under the assumptions of the previous subclaim we have by condition T2(b) that \(\mathcal {O}\) is good. Recall by considerations at the beginning of the proof that the status of any fourientation \(\mathcal {O}\) was only at issue if \(\mathcal {O}= \{e^{\varepsilon }\}\) for some \(\varepsilon \in \{+,\}\) and \(\mathcal {O}{\setminus } e_n\) was bad. But we just showed that in this case the status of \(\mathcal {O}\) still agrees with the minedge cut property defined by \((X,\delta )\). So we are done with Case I.
Case II: \(\mathcal {O}^{2'}\) is a good fourientation of \((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<)\).
Note that this case is in contradiction with the minedge cut property defined by \((X,\delta )\). We claim that our Tutte property must be cut weird.
Subclaim 3
We have \(\{\} \in X\).
Proof
Suppose to the contrary. Define the auxiliary graph \(G^{*}\) by \(V(G^{*}) :=\{u,v,w\}\) and \(E(G^{*}) :=\{e_1,e_2,e_3\}\) where \(e_1 :=e_3 :=\{u,v\}\) and \(e_2 :=\{u,w\}\). Define \(\mathcal {O}_{\mathrm {ref}}^{*}\) by \(\mathcal {O}_{\mathrm {ref}}^{*}(e_1^{+}) :=\mathcal {O}_{\mathrm {ref}}^{*}(e_3^{+}) :=(u,v)\) and \(\mathcal {O}_{\mathrm {ref}}^{*}(e_2^{+}) :=(w,u)\). Then \(\mathcal {O}^{*} :=\{e_2^{},e_3^{+}\}\) is good for \(\mathbb {G}^{*} :=(G^{*},\mathcal {O}_{\mathrm {ref}}^{*},<)\): the graph \(G^{*}\) has two simple cuts \({Cu}_1 :=\{ \{u,v\}, \{w\}\}\) and \({Cu}_2 :=\{ \{u,w\}, \{v\}\}\) and we have that \((\mathbb {G}^{*}_{{Cu}_1},\mathcal {O}^{*}_{{Cu}_1}) \simeq ((B_1,\mathcal {O}_{\mathrm {ref}}^{1},<),\{e_1^{}\})\) and \((\mathbb {G}^{*}_{{Cu}_2},\mathcal {O}^{*}_{{Cu}_2}) \simeq ((B_2,\mathcal {O}_{\mathrm {ref}}^{2},<),\mathcal {O}^2)\), both of which are good by supposition. Let \(G^{*'}\) be the graph obtained from \(G^{*}\) by adding an edge \(e_4 :=\{v,w\}\), and let \(\mathcal {O}_{\mathrm {ref}}^{*'}\) be any extension of \(\mathcal {O}_{\mathrm {ref}}^{*}\). Then \(\mathcal {O}^{*}\) is good for \(\mathbb {G}^{*'} :=(G^{*'},\mathcal {O}_{\mathrm {ref}}^{*'},<)\) by condition T2(a). Set \({Cu}_3 :=\{ \{u\}, \{v,w\}\}\), a cut of \(G^{*'}\). The contraction \((\mathbb {G}^{*'}_{{Cu}_3},\mathcal {O}^{*}_{{Cu}_3})\) is good; by removing \(e_3\) from this contraction using T2(a) we get that something isomorphic to \(((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<),\mathcal {O}^{2'})\) is good. But \(\mathcal {O}^{2'}\) and \(\mathcal {O}^{2'}\) both being good for \((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<)\) contradict T2(b). So \(\{\} \in X\). \(\square \)
Subclaim 4
We have \(\{+\} \notin X\).
Proof
Define the auxiliary graph \(G^{*}\) by \(V(G^{*}) :=\{u,v,w\}\) and \(E(G^{*}) :=\{e_1,e_2\}\) where \(e_1 :=\{u,v\}\) and \(e_2 :=\{u,w\}\). Define \(\mathcal {O}_{\mathrm {ref}}^{*}(e_1^{+}) :=(u,v)\) and \(\mathcal {O}_{\mathrm {ref}}^{*}(e_2^{+}) :=(u,w)\). Set \(\mathcal {O}^{*} :=\{e_2^{+}\}\). Then \(\mathcal {O}^{*}\) is bad for \(\mathbb {G}^{*} :=(G^{*},\mathcal {O}_{\mathrm {ref}}^{*},<)\) because its contraction to \({Cu}_1:=\{\{u,w\},\{v\}\}\) is bad. Let \(G^{*'}\) be the graph obtained from \(G^{*}\) by adding an edge \(e_3 :=\{v,w\}\), let \(\mathcal {O}_{\mathrm {ref}}^{*'}\) be the extension of \(\mathcal {O}_{\mathrm {ref}}^{*}\) with \(\mathcal {O}_{\mathrm {ref}}^{*'}(e_3^{+}) :=(v,w)\), and let \(\mathcal {O}^{*'} :=\mathcal {O}^{*} \cup \{e_3^{+},e_3^{}\}\). Note that \(\mathcal {O}^{*'}\) is good for \(\mathbb {G}^{*'} :=(G^{*'},\mathcal {O}_{\mathrm {ref}}^{*'},<)\): the contractions to \({Cu}_1\) and \({Cu}_2 :=\{\{u,v\},\{w\}\}\) no longer give potential cuts, and the contraction to \({Cu}_3 :=\{\{u\},\{v,w\}\}\) is isomorphic to \(((B_2,\mathcal {O}_{\mathrm {ref}}^{2},<),\mathcal {O}^2)\). So by condition (2b), one of \(\mathcal {O}^{*}\cup \{e_3^{+}\}\) or \(\mathcal {O}^{*}\cup \{e_3^{}\}\) must be good for \(\mathbb {G}^{*'}\). Note that \(\mathcal {O}^{*}\cup \{e_3^{}\}\) is not good because the contraction of \((\mathbb {G}^{*'},\mathcal {O}^{*}\cup \{e_3^{}\})\) to \({Cu}_1\) is isomorphic to \(((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<),\mathcal {O}^{2'})\), which is bad by condition T2(b) since \(((B_2,\mathcal {O}_{\mathrm {ref}}^{2'},<),\mathcal {O}^{2'})\) is good. So \(\mathcal {O}^{*}\cup \{e_3^{+}\}\) must be good; but then \(((B_2,\mathcal {O}_{\mathrm {ref}}^2,<),\{e_1^{+},e_2^{+}\})\), which is isomorphic to the contraction of \((\mathbb {G}^{*'},\mathcal {O}^{*}\cup \{e_3^{+}\})\) to \({Cu}_2\), is good. Then by T2(b) and T1 we get \(\{+\} \notin X\). \(\square \)
Therefore, we must have \(X = \{\varnothing ,\{\}\}\). This indeed is possible. In this case, the good fourientations are the cut weird fourientations. To see that these are exactly the good fourientations, again we can just check agreement on banana graphs. The only case not addressed by above considerations is when \(\mathcal {O}\) is a fourientation of \((B_n,\mathcal {O}_{\mathrm {ref}},<)\) for some \(n > 1\) where \(e_n^{\varepsilon } \in \mathcal {O}\) for \(\varepsilon \in \{,+\}\) and \(\mathcal {O}{\setminus } e_n = \varnothing \) is bad.
Subclaim 5
Let \(n > 1\). Set \(\mathcal {O}:=\{e_n^{+}\}\). Then \(\mathcal {O}\) is good for any \((B_n,\mathcal {O}_{\mathrm {ref}},<)\).
Proof
We prove this by induction on n. The case \(n=2\) is true by our suppositions. So assume \(n > 2\) and the result holds for smaller n. Assume without loss of generality that \(\mathcal {O}_{\mathrm {ref}}(e^{+}_1) = (u,v)\). Suppose \(\mathcal {O}_{\mathrm {ref}}(e_{n1}^{\gamma }) = \mathcal {O}_{\mathrm {ref}}(e_{n}^{\gamma '}) = (u,v)\) for \(\gamma , \gamma ' \in \{+,\}\). Define the auxiliary graph \(G^{*}\) by \(V(G^{*}) :=\{u,v,w\}\) and \(E(G^{*}) :=\{e_1,\ldots ,e_{n+1}\}\) where \(e_1 :=\ldots :=e_{n2} :=e_{n} :=\{u,v\}\) and \(e_{n1} :=e_{n+1} :=\{u,w\}\). Define \(\mathcal {O}_{\mathrm {ref}}^{*}\) by \(\mathcal {O}_{\mathrm {ref}}^{*}(e_{i}) :=\mathcal {O}_{\mathrm {ref}}(e_i)\) for all \(1 \le i \le n2\) and \(\mathcal {O}_{\mathrm {ref}}^{*}(e_{n1}^{\gamma }) :=\mathcal {O}_{\mathrm {ref}}^{*}(e_{n+1}^{\gamma '}) :=(u,w)\) and \(\mathcal {O}_{\mathrm {ref}}^{*}(e_n^{\gamma '}) :=(u,v)\). Let \(\mathcal {O}^{*} :=\{e_{n}^{+},e_{n+1}^{+}\}\). Then \(\mathcal {O}^{*}\) is good for \(\mathbb {G}^{*} :=(G^{*},\mathcal {O}_{\mathrm {ref}}^{*},<)\): the graph \(G^{*}\) has two simple cuts \({Cu}_1 :=\{ \{u,v\}, \{w\}\}\) and \({Cu}_2 :=\{ \{u,w\}, \{v\}\}\); the contraction to \({Cu}_1\) is isomorphic to \(((B_2,\mathcal {O}_{\mathrm {ref}}^2,<),\mathcal {O}^2)\) or to \(((B_2,\mathcal {O}_{\mathrm {ref}}^2,<),\mathcal {O}^{2'})\), which are good, and the contraction to \({Cu}_2\) is isomorphic to \(((B_{n1},\mathcal {O}_{\mathrm {ref}}^{'},<),\{e_{n1}^{+}\})\), which is good by our inductive hypothesis. Let \(G^{*'}\) be the graph obtained from \(G^{*}\) by adding an edge \(e_{n+2} :=\{v,w\}\), and let \(\mathcal {O}_{\mathrm {ref}}^{*'}\) be any extension of \(\mathcal {O}_{\mathrm {ref}}^{*}\). By condition T2(c), we have that \(\mathcal {O}^{*}\) remains good for \(\mathbb {G}^{*'} :=(G^{*'},\mathcal {O}_{\mathrm {ref}}^{*'},<)\). Set \({Cu}_3 :=\{ \{u\}, \{v,w\}\}\), a cut of \(G^{*'}\). The contraction \((\mathbb {G}^{*'}_{{Cu}_3}, \mathcal {O}^{*}_{{Cu}_3})\) is good; by removing \(e_{n+1}\) from this contraction using condition T2(a) we get that something isomorphic to \(((B_n,\mathcal {O}_{\mathrm {ref}}^{n},<),\mathcal {O})\) is good. \(\square \)
Under the assumptions of the previous subclaim we have by condition T2(b) that \(\mathcal {O}\) is bad. So indeed any property that lands in Case II would have to be cut weird. By mimicking the proof of Theorem 2.17 one can show that cut weird actually defines a consistent Tutte cut property. Finally note that if \(\delta = +\) then by a completely symmetric argument either our Tutte property is still a minedge cut property or we arrive at the other exceptional case where our property is cut coweird. \(\square \)
Remark 2.19
 (i\('\)):

\(\{\varepsilon :e_{\mathrm {min}}^{\varepsilon } \in \mathcal {O}\} = S\) for some \(S \in X\), where \(e_{\mathrm {min}}\) is the minimum edge in \(E(\overrightarrow{{C}})\) ;
 (ii\('\)):

if \(e_{\mathrm {min}}\) is unoriented (bioriented) in \(\mathcal {O}\) then \(e_{\mathrm {min}}^{\delta \cdot \sigma (e_{\mathrm {min}})} \in \mathbb {E}(\overrightarrow{{C}})\).
3 Specializations
In this section, we consider (k, l, m)fourientations for special values of (k, l, m). Let us call a fourientation with no bioriented edges a Type A fourientation, and a fourientation with no unoriented edges a Type B fourientation. In other words, a Type A fourientation is a (1, 1, 0)fourientation and a Type B fourientation is a (1, 0, 1)fourientation. The fourientations that are both Type A and Type B, the (1, 0, 0)fourientations, are precisely the total orientations. The impetus for this research was actually to unify the study of various classes of partial orientations. We now explain how Tutte fourientation properties give rise to many interesting classes of partial orientations.
3.1 Partial orientations
Definition 3.1
A partial orientation of \((G,\mathcal {O}_{\mathrm {ref}})\) is a subset \(\mathcal {O}\) of \(\mathbb {E}(G)\) such that for each \(e \in E(G)\) at least one of \(e^{+}\) or \(e^{}\) is not in \(\mathcal {O}\). If \(e^{+} \notin \mathcal {O}\) and \(e^{} \notin \mathcal {O}\) then we say e is neutral in \(\mathcal {O}\) and we write \(e \notin \mathcal {O}\). If \(e^{\pm } \in \mathcal {O}\) then we say e is oriented in \(\mathcal {O}\).
So a partial orientation is just a Type A fourientation where we call the unoriented edges neutral. The reason we use “neutral” instead of “unoriented” when studying partial orientations is because we actually want to consider Type A and Type B fourientations “simultaneously.” Let us call the images of the minedge classes of fourientations under the identity map from Type A fourientations to partial orientations the Type A classes of partial orientations. There is also an obvious bijection from the set of Type B fourientations of \(\mathbb {G}\) to the set of partial orientations of \(\mathbb {G}\) where we treat bioriented edges as neutral. Let us call the images of the minedge classes of fourientations under this second bijection the Type B classes of partial orientations. Many (but not all) of the minedge classes of partial orientations have been studied before, as we detail in Sect. 4. In order to explicitly describe the Type A and B classes of partial orientations, let us give some preliminary definitions.
Definition 3.2
By abuse of language, a directed cut (cycle) of a partial orientation is a directed cut (cycle) of the underlying oriented graph for which all edges are oriented in agreement with the cut (cycle). A potential cut (cycle) of a partial orientation is a directed cut (cycle) of the underlying oriented graph for which all oriented edges are oriented consistently with the cut (cycle), but neutral edges are allowed. In symbols, \(\overrightarrow{{C}}\) is a directed cut (cycle) of \(\mathcal {O}\) if \(e^{\pm } \in \mathbb {E}(\overrightarrow{{C}}) \Rightarrow e^{\pm } \in \mathcal {O}\) for all \(e \in E\), whereas \(\overrightarrow{{C}}\) is a potential cut (cycle) of \(\mathcal {O}\) if \(e^{\pm } \in \mathbb {E}(\overrightarrow{{C}}) \Rightarrow e^{\mp } \notin \mathcal {O}\) for all \(e \in E\).
 (1)
Cut/cycle general: There are no restrictions on cuts/cycles.
 (2)
Cycle minimal: The minimum edge in each directed cycle is oriented in agreement with its reference orientation.
 (3)
Cycle maximal: The minimum edge in each directed cycle is oriented in disagreement its the reference orientation.
 (4)
Acyclic: There are no directed cycles.
 (5)
Cut directed: For each potential cut, if the minimum edge of the cut is neutral then the cut contains an oriented edge directed in agreement with the reference orientation of this minimum edge.
 (6)
Cut negative: The minimum edge in each potential cut is neutral or is oriented in agreement with its reference orientation.
 (7)
Cut positive: The minimum edge in each potential cut is neutral or is oriented in disagreement with its reference orientation.
 (8)
Cut connected: Each potential cut contains an oriented edge directed in agreement with the reference orientation of the minimum edge in the cut.
 (9)
Cut coconnected: For each potential cut, either the minimum edge of the cut is neutral and the cut contains an oriented edge directed in agreement with the reference orientation of this minimum edge, or the minimum edge is oriented in disagreement with its reference orientation.
 (10)
Cut neutral: The minimum edge in each potential cut is neutral.
 (11)
Cut positively connected: The minimum edge in each potential cut is neutral and the cut contains an oriented edge directed in agreement with the reference orientation of this minimum edge.
Remark 3.3
The containment relations depicted in Fig. 3 imply inequalities among the generalized Tutte polynomial evaluations in Fig. 4: for instance, for any graph G on n vertices with cyclomatic number g we have \(2^{g}\cdot T_G(2,\frac{3}{2}) \le 2^{n1}\cdot T_G(1,3)\).
3.2 Total orientations
 (1)
Cut general: There are no restrictions on cuts.
 (2)
Cut minimal: The minimum edge in each directed cut is oriented in agreement with its reference orientation.
 (3)
Cut maximal: The minimum edge in each directed cut is oriented in disagreement with its reference orientation.
 (4)
Strongly connected: There are no directed cuts.

Middle row:
 –
cycle minimal total orientations;
 –
cycle maximal total orientations;
 –
equivalence classes of total orientations modulo cycle reversals;
 –
indegree sequences of total orientations.
 –

Middle column:
 –
cut minimal total orientations;
 –
cut maximal total orientations;
 –
equivalence classes of total orientations modulo cocycle reversals;
 –
qconnected total orientations.
 –
3.3 Tables of enumerations
Figure 4 displays four tables recording the generalized Tutte polynomial evaluations that, as a consequence of Theorem 2.14, enumerate the various minedge classes of generalized orientations.
3.4 Subgraphs
 (1)
Cut general: There are no restrictions on cuts.
 (2)
Connected: The subgraph has no cuts.
 (1)
Cycle general: There are no restrictions on cuts.
 (2)
Forest: The subgraph has no cycles.
3.5 Future work: activities
For a fourientation \(\mathcal {O}\) of \(\mathbb {G}\) let \(\mathcal {O}^{o}\) denote the set of oriented edges of \(\mathcal {O}, \mathcal {O}^{u}\) the set of unoriented edges, and \(\mathcal {O}^{b}\) the set of bioriented edges as in the statement of Theorem 2.14. Also, let \(\mathcal {O}^{+}\) denote the set of edges oriented in agreement with the reference orientation and \(\mathcal {O}^{}\) the set of edges oriented in disagreement with the reference orientation so that \(\mathcal {O}^{o} = \mathcal {O}^{+} \cup \mathcal {O}^{}\).

e is oriented in \(\mathcal {O}\) and is the minimum edge of some potential cut of \(\mathcal {O}\);

e is unoriented in \(\mathcal {O}\) and is the minimum edge of some potential cut of \(\mathcal {O}\cup \{e^{}\}\).

e is oriented in \(\mathcal {O}\) and is the minimum edge of some potential cycle of \(\mathcal {O}\);

e is bioriented in \(\mathcal {O}\) and is the minimum edge of some potential cycle of \(\mathcal {O}{\setminus } \{e^{+}\}\).
4 Connections between minedge classes and geometric, combinatorial, and algebraic objects
The midedge classes of fourientations enumerated in our main Theorem 2.14 are not simply formal combinatorial objects. In this section, we illustrate their broader significance by highlighting connections to several different mathematical topics such as bigraphical arrangements, cycle–cocycle reversal systems, Riemann–Roch theory for graphs, zonotopal algebra, graphic Lawrence ideals, and the reliability polynomial. In the future, we hope that a more unified understanding of these various relationships will arise which incorporates additional minedge classes.
Throughout this section, we fix an ordered, oriented graph \(\mathbb {G}= (G,\mathcal {O}_{\mathrm {ref}},<)\) which has \(n :=V(G)\) vertices and cyclomatic number \(g :=E(G)  V(G) + 1\). We will suppress mention of the reference orientation and edge order where it is not necessary (and thus for example speak of fourientations or partial orientations of G).
4.1 Bi(co)graphical arrangements
Cycle neutral partial orientations are related to the bigraphical arrangements originally defined by the second author and Perkinson [35]. We explain this relationship precisely here and also define for the first time the object dual to the bigraphical arrangement, namely the bicographical arrangement. The bi(co)graphical arrangement depends on the graph G as well as a parameter list \(A = (a_{e^{\pm }}) \in \mathbb {R}_{>0}^{\mathbb {E}(G)}\), which is a list of positive real parameters \(a_{e^{+}}, a_{e^{}} \in \mathbb {R}_{>0}\) for each \(e \in E(G)\) subject to the technical restriction that \(a_{e_1^{\delta _1}} \ne a_{e_2^{\delta _2}}\) for \(e_1^{\delta _1} \ne e_2^{\delta _2} \in \mathbb {E}(G)\) with \(\mathcal {O}_{\mathrm {ref}}(e_1^{\delta _1}) = \mathcal {O}_{\mathrm {ref}}(e_2^{\delta _2})\). For an appropriate choice of parameters, the regions of the bi(co)graphical arrangement are in bijection with cycle (cut) neutral partial orientations; moreover, the regions that avoid a certain generic hyperplane are in bijection with cut minimalcycle neutral (cycle minimalcut neutral) partial orientations, and the bounded regions are in bijection with strongly connectedcycle neutral (acycliccut neutral) partial orientations. The result concerning bounded regions of the bigraphical arrangement was essentially already proved in [35], albeit in slightly different language. In general, for any hyperplane arrangement \(\mathcal {A}\) these three region counts (total number of regions, number of regions avoiding a generic hyperplane, number of bounded regions) are given (up to sign) by evaluating the characteristic polynomial at \(t = 1,0,1\). These three characteristic polynomial evaluations allow us to explain an entire row (resp., column) in one of the tables in Fig. 4 in terms of the bi(co)graphical arrangement.
The degenerate case of the bi(co)graphical arrangement where we set all the parameters \(a_{e^{\pm }}\) to 0 recovers the (co)graphical arrangement. Many of the results here are extensions from total orientations to partial orientations of results obtained by Greene and Zaslavsky in [32], especially §8 of that paper which explores the cographical arrangement. In the proofs in this subsection we assume some familiarity with the theory of hyperplane arrangements, especially the notions of the intersection poset and characteristic polynomial of a hyperplane arrangement; see [63] for all the relevant definitions and background information.
Definition 4.1
Definition 4.2
 (a)
R is in the halfspace of \(U {\setminus } H_{e^{+}}\) opposite from \(H_{e^{}}\);
 (b)
R is in the halfspace of \(U {\setminus } H_{e^{}}\) opposite from \(H_{e^{+}}\);
 (c)
R is between \(H_{e^{+}}\) and \(H_{e^{}}\).
Proposition 4.3
The map \(R \mapsto \mathcal {O}_R\) is a bijection between the regions of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) and the cycle neutral partial orientations of \(\mathbb {G}\).
Proof
Proposition 4.4
The map \(R \mapsto \mathcal {O}_R\) is a bijection between the regions of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) and the cut neutral partial orientations of \(\mathbb {G}\).
Proof
This proposition is formally dual to the previous one. Using the same techniques as in [35] we can describe when a partial orientation is in the image of \(R \mapsto \mathcal {O}_R\) in terms of scores associated with potential cuts, and we will see that with \(A^<\) the Acoadmissible partial orientations will be precisely the cut neutral ones. Alternatively, one could also prove, as in [35, Theorem 3.2], that because \(A^<\) is generic the characteristic polynomial of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) is , which would show via Zaslavsky’s theorem [63, Theorem 2.5], [68] that there are at least the same number of cut neutral partial orientations as regions of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\). Then it is easy to see that \(\mathcal {O}_R\) for R a region of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) cannot have a potential cut whose minimum edge is directed, proving that the map is indeed a bijection. \(\square \)
Compare the following propositions to [32, Corollary 8.2].
Proposition 4.5
Let \(M \gg 0\) be some large positive constant and define the hyperplane \(H_0 \subseteq \mathbb {R}^{n1}\) by \(H_0 :=\sum _{e \in E(G), e^{+}=(u,v)} a^{<}_{e^{+}} (x_v  x_u) =M\). Then the map \(R \mapsto \mathcal {O}_R\) is a bijection between the regions R of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) with \(R \cap H_0 = \varnothing \) and the cut minimalcycle neutral partial orientations of \(\mathbb {G}\).
Proof
Let \(\mathcal {A}\) be an essential arrangement of hyperplanes in \(\mathbb {R}^k\). Let us say the hyperplane \(H_0\) is in general position with respect to \(\mathcal {A}\) if for any \(H_1,\ldots ,H_m \in \mathcal {A}\), we have that \(\mathrm {dim}(H_1 \cap \ldots \cap H_m \cap H_0) = \mathrm {dim}(H_1 \cap \ldots \cap H_m)  1\) if \(\mathrm {dim}(H_1 \cap \ldots \cap H_m) \ge 1\) and \(H_1 \cap \ldots \cap H_m \cap H_0 = \varnothing \) if \(\mathrm {dim}(H_1 \cap \ldots \cap H_m) < 1\). Suppose H is in general position with respect to \(\mathcal {A}\). Then the number of regions R of \(\mathcal {A}\) such that \(H \cap R = \varnothing \) is given by , where is the characteristic polynomial of \(\mathcal {A}\). This interpretation of is due to Greene and Zaslavsky [32, Theorem 3.1].
Recall that a hyperplane arrangement \(\mathcal {A}\) is generic if for all \(H_{i_1},\ldots ,H_{i_k} \in \mathcal {A}\) we have that \(H_{i_1} \cap \cdots \cap H_{i_k} \ne \varnothing \) if and only if the normal vectors to the \(H_{i_j}\) are linearly independent (see [63, §2]). We say that a parameter list A is generic if \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A)\) is generic. It is shown in [35, Theorem 3.2] that for generic A, the characteristic polynomial of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A)\) is . Thus, the previous claim tells us that the number of regions of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A)\) for generic A that avoid a generic hyperplane is \(2^{n1}T_G(1,1)\), which is precisely the number of cut minimalcycle positive partial orientations of G by Theorem 2.14. It is easy to see that \(A^<\) is a generic parameter list and \(H_0\) is in general position with respect to \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\).
Proposition 4.6
Let \(M \gg 0\) be some large positive constant and define the hyperplane \(H_0 \subseteq \mathbb {R}^{g}\) by \(H_0 :=\sum _{e \in E(G)} a^{<}_{e^{+}} x_{e^{+}} =M\). Then the map \(R \mapsto \mathcal {O}_R\) is a bijection between the regions R of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) with \(R \cap H_0 = \varnothing \) and the cycle minimalcut neutral partial orientations of \(\mathbb {G}\).
Proof
Again, this proposition is formally dual to the previous one and the key is to compute the characteristic polynomial of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\). \(\square \)
The following propositions should be seen as analogous to the fact that there are no strongly connectedacyclic total orientations, which agrees with there being no bounded regions of the (co)graphical arrangement.
Proposition 4.7
The map \(R \mapsto \mathcal {O}_R\) is a bijection between the regions of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) that are bounded and the strongly connectedcycle neutral partial orientations of \(\mathbb {G}\).
Proof
It is shown in [35, Theorem 1.8] that the bounded regions R of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A)\) for any parameter list A are those for which \(\mathcal {O}_R\) is Aadmissible and such that every oriented edge in \(\mathcal {O}_R\) belongs to a potential cycle. Although they did not describe it in these terms, that is equivalent to saying that the bounded regions R are those for which \(\mathcal {O}_R\) is Aadmissible and strongly connected because, in light of Proposition 2.6, each oriented edge in a partial orientation either belongs to a potential cycle or to a directed cut, but not both. Thus indeed the bounded regions R of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) are those for which \(\mathcal {O}_R\) is strongly connected and cycle neutral. \(\square \)
Proposition 4.8
The map \(R \mapsto \mathcal {O}_R\) is a bijection between the regions of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) that are bounded and the acycliccut neutral partial orientations of \(\mathbb {G}\).
Proof
This proposition is again dual to the previous one. \(\square \)
Example 4.9
Take \(\mathcal {O}_{\mathrm {ref}}\) as above and let < be given by \(e_1< e_2 < e_3\). The Tutte polynomial of G is \(T_G(x,y) = x^2 + x + y\). Figure 5 shows the bigraphical arrangement of \(\mathbb {G}\) together with a labeling of its regions by partial orientations. Note that there are \(2^{n1}T_G(\frac{3}{2},1) = 19\) regions of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) and their labels are the cycle neutral partial orientations. There are \(2^{n1}T_G(1,1) = 12\) regions of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) that avoid \(H_0\), shaded in light and dark gray, and their labels are the cut minimalcycle neutral partial orientations. There are \(2^{n1}T_G(\frac{1}{2},1) = 7\) bounded regions of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\), shaded in dark gray, and their labels are the strongly connectedcycle neutral partial orientations. Figure 6 depicts the bicographical arrangement of G similarly labeled.
Corollary 4.10
Proof
The distance enumerator \(D_{\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A^<),R_0}(y)\) is just the generating function for cycle neutral partial orientations by number of oriented edges and so the claimed formula holds by Theorem 2.14. The case of \(D_{\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<),R_0}(y)\) is analogous. \(\square \)
Remark 4.11
Remark 4.12
Let \(W \simeq \mathbb {R}^{E(G)}\) be a real vector space with basis \(x_{e^{+}}\) for \(e \in E(G)\) with the convention that \(x_{e^{}} = x_{e^{+}}\). Let \(\mathcal {E}_{(G,\mathcal {O}_{\mathrm {ref}})}(A) :=\{H_{e^{\pm }}\}\) be the “perturbed coordinate hyperplane arrangement” in W with \(H_{e^{\pm }} :=x_{e^{\pm }} = a_{e^{\pm }}\). For a directed cut or cycle \(\overrightarrow{{C}}\) of G define the vector \(x_{\overrightarrow{{C}}} :=\sum _{e^{\pm } \in \mathbb {E}(\overrightarrow{{C}})}x_{e^{\pm }} \in W\). The bicographical arrangement is the projection of \(\mathcal {E}_{(G,\mathcal {O}_{\mathrm {ref}})}(A)\) to the subspace \(U\subseteq W\) where \(x_{\overrightarrow{{Cu}}} = 0\) for all directed cuts \(\overrightarrow{{Cu}}\) of G. In order to make the bicographical arrangement look more like the bicographical arrangement, one can also view it as the projection of \(\mathcal {E}_{(G,\mathcal {O}_{\mathrm {ref}})}(A)\) to the subspace \(U'\subseteq W\) where \(x_{\overrightarrow{{Cy}}} = 0\) for all directed cycles \(\overrightarrow{{Cy}}\) of G. Consequently, one might wonder which other minedge classes of partial orientations can be described by projecting \(\mathcal {E}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\) to various subspaces: for instance, the set of all partial orientations is naturally in bijection with the regions of \(\mathcal {E}_{(G,\mathcal {O}_{\mathrm {ref}})}(A^<)\).
Remark 4.13
There is another notion of acyclicity for partial orientations which is not to be confused with our acyclic partial orientations. In a recent paper of Iriarte [37], this other kind of acyclic partial orientation is called a “partial acyclic orientation.” A partial acyclic orientation is one for which the contraction of all neutral edges yields an acyclic total orientation. By contrast, the acyclic partial orientations studied in this paper are those such that the deletion of all neutral edges yields an acyclic total orientation. There is a bijection between the partial acyclic orientations of a graph and the faces (i.e., the regions and the faces of lower dimension) of its ordinary graphical arrangement (see Greene–Zaslavsky [32, Lemma 7.2] or Zaslavsky [69, Corollary 4.6], who proves a stronger version of this result that holds at the level of signed graphs). Recast in our terminology, these partial acyclic orientations are the partial orientations whose only potential cycles consist of all neutral edges. Apparently the partial acyclic orientations are not enumerated in a simple way by the Tutte polynomial. However, we remark that these partial acyclic orientations are precisely the partial orientations that are cycle neutral for all choices of edge order <. They are also the partial orientations that are Aadmissible for all choices of parameter list \(A\in \mathbb {R}_{>0}^{\mathbb {E}(G)}\).
4.2 Cycle/cocycle reversal systems and Riemann–Roch theory for fourientations
Recall the definitions of cycle and cocycle reversals, and of the cycle, cocycle, and cycle–cocycle reversal systems from Sect. 3.2 above. Gioan [27] used the cycle/cocycle reversal systems to give a unified framework for understanding the evaluations T(x, y) for \(0 \le x,y \le 2\) integral. Each equivalence class in the cycle (cocycle) reversal system contains a unique cycle (cut) minimal orientation and so these objects give distinguished representatives. Thus, the \(3 \times 3\) table at the bottom of Fig. 4 is equivalent to Gioan’s \(3 \times 3\) square. Furthermore, Gioan also showed that the two orientations are in the same equivalence class of the cycle–cocycle reversal system if and only if their associated indegree sequences are equivalent by chipfiring moves, which we now describe: given a chip configuration, which is simply a function from the vertices to the integers, a vertex fires by sending a chip to each of its neighbors and losing its degree number of chips in the process; we say that two chip configurations D and \(D'\) are chipfiring equivalent if we can get from one to the other by a sequence of chipfirings moves. Equivalently, if we view D and \(D'\) as vectors, then they are chipfiring equivalent when their difference is in the integer span of the columns of the Laplacian matrix of G.
In [4, 5], the first author investigated two different extensions of Gioan’s cycle/cocycle reversal systems for partial orientations. One extension, which we call the cycle/cocycle reversal systems for partial orientations, describes the set of partial orientations modulo cycle and/or cocycle reversals. The definition of (co)cycle reversals for partial orientations is exactly the same as for total orientations: given a partial orientation \(\mathcal {O}\) of \(\mathbb {G}\), a (co)cycle reversal is the operation of replacing \(\mathcal {O}\) by \((\mathcal {O}{\setminus } \mathbb {E}(\overrightarrow{{C}})) \cup \mathbb {E}(\overrightarrow{{C}})\) for some directed cycle (cut) \(\overrightarrow{{C}}\) of \(\mathcal {O}\). These cycle/cocycle reversal systems are related to the graphic and cographic Lawrence ideals from combinatorial commutative algebra, and in [4] it was demonstrated that they define equivalence classes of partial orientations counted by generalized Tutte polynomial evaluations. Each equivalence class in the (co)cycle reversal system contains a unique cycle (cut) minimal partial orientation. The (co)graphic Lawrence ideals and their connection to fourientations are discussed in Sect. 4.5. The other extension, which we call the generalized cycle/cocycle reversal systems for partial orientations, was introduced in [5] for the study of chipfiring in the context of Baker and Norine’s combinatorial Riemann–Roch theorem [7]. We now explain how this extension allows for a direct and esthetically pleasing interpretation of the graphical Riemann–Roch duality in terms of fourientations. At the time of writing, the precise connection between the Tutte polynomial and the generalized cycle/cocycle reversal systems remains a mystery.
In [5], an edge pivot for partial orientations was defined as follows: given an edge e oriented toward a vertex v and \(e'\) a neutral edge incident to v, we may unorient e and orient \(e'\) toward v. This name is motivated by the image of an oriented edge nailed down at its head which can pivot to other unoriented edges. The generalized cycle, cocycle and cycle–cocycle reversal systems for partial orientations are defined to be these systems extended to partial orientations by the inclusion of edge pivots.
We can of course define cycle and cocycle reversals for fourientations. For a fourientation \(\mathcal {O}\) of G, we say the directed cut (cycle) \(\overrightarrow{{C}}\) is directed cut (cycle) of \(\overrightarrow{{C}}\) if \(\mathbb {E}(\overrightarrow{{C}}) \subseteq \mathcal {O}\) and \(\mathbb {E}(\overrightarrow{{C}}) \cap \mathcal {O}= \varnothing \). Then, as before, a (co)cycle reversal is the operation of replacing \(\mathcal {O}\) by \((\mathcal {O}{\setminus } \mathbb {E}(\overrightarrow{{C}})) \cup \mathbb {E}(\overrightarrow{{C}})\) for some directed cycle (cut) \(\overrightarrow{{C}}\) of \(\mathcal {O}\). The cycle/cocycle reversal systems for fourientations are defined in terms of these reversals.
Remark 4.14
A cycle reversal in a fourientation can be performed by a sequence of generalized edge pivots as depicted in Fig. 8. Thus, the generalized cycle–cocycle reversal system and the generalized cocycle reversal system for fourientations agree.
For a fourientation \(\mathcal {O}\) of G and a vertex \(v \in V(G)\), we define the indegree of \(\mathcal {O}\) at v to be \(\mathrm {indeg}_{\mathcal {O}}(v) :=\{e^{\pm } = (u,v) \in \mathcal {O}\}\). In keeping with the terminology of algebraic geometry, we define the divisor associated with the fourientation \(\mathcal {O}\) to be \(D_{\mathcal {O}} :=\sum _{v \in V(G)} (\mathrm {indeg}_{\mathcal {O}}(v)1)(v)\) viewed as a formal sum of the vertices with integer coefficients. Similarly, given two divisors D and \(D'\) we write \(D \sim D'\) if they are equivalent by chipfiring moves and say they are linearly equivalent. See [54] or the upcoming book [18] for background on linear equivalence of divisors. We note that our terminology is justified by the rich connection between combinatorial divisor theory for graphs and chipfiring [3, 7, 16, 49]. Lemma 3.1 of [5] says that two partial orientations are equivalent in the generalized cycle reversal system if and only if they have the same associated divisors, which extends Gioan’s [27, Proposition 4.10] from total to partial orientations. We now further extend this result to the setting of fourientations.
Lemma 4.15
Two fourientations \(\mathcal {O}\) and \(\mathcal {O}'\) are equivalent by edge pivots if and only if \(D_{\mathcal {O}} = D_{\mathcal {O}'}\).
Proof
It is clear that if \(\mathcal {O}\) and \(\mathcal {O}'\) are equivalent in the generalized cycle reversal system then \(D_{\mathcal {O}} = D_{\mathcal {O}'}\). We now demonstrate the converse. First suppose that there exists some edge \(e = (u,v)\) such that e is oriented toward v in \(\mathcal {O}\), but e is bioriented in \(\mathcal {O}'\). Because \(D_{\mathcal {O}} = D_{\mathcal {O}'}\) we know that there exists some \(e'\) incident to u such that \(e'\) is not oriented toward u in \(\mathcal {O}\). We can perform a pivot from e to \(e'\) in \(\mathcal {O}\). By induction on the symmetric difference of \(\mathcal {O}\) and \(\mathcal {O}'\) we may assume that no such edge exists. Therefore, their symmetric difference is a Type A fourientation, and we therefore reduce to Lemma 3.1 of [5]. \(\square \)
Given a fourientation \(\mathcal {O}\), we define \(\mathcal {O}^c\) to be the fourientation obtained by reversing the orientation of each directed edge, replacing each unoriented edge with a bioriented edge, and replacing each bioriented edge with an unoriented edge. In other words, we set \(\mathcal {O}^c :=\mathbb {E}(G) {\setminus } \mathcal {O}\). Recall the canonical divisor of G is \(K = \sum _{v \in V(G)} (\mathrm {deg}(v)2)(v)\) where the degree of \(v \in V(G)\) is \(\mathrm {deg}(v) :=\{e = \{u,v\}:e \in E(G), u \in V(G)\}\). Baker and Norine’s Riemann–Roch formula for graphs [7] investigates the rank of a divisor D, written r(D), in comparison with \(r(KD)\). We do not review the definition of rank here, nor the Riemann–Roch formula, but we note the following important observation.
Remark 4.16
If \(\mathcal {O}\) is a fourientation, then \(KD_{\mathcal {O}}= D_{\mathcal {O}^c}\). Thus, the divisors associated with complementary fourientations are Riemann–Roch dual.
Lemma 4.17
If \(\mathcal {O}\) and \(\mathcal {O}'\) are fourientations, then \(\mathcal {O}\sim \mathcal {O}'\) if and only if \(\mathcal {O}^c \sim (\mathcal {O}')^{c}\).
Proof
This is trivial. \(\square \)
Lemma 4.18
 (i)
\(\mathcal {O}\sim \mathcal {O}'\) with \(\mathcal {O}'\) a Type A fourientation if and only if \(\mathrm{deg}(D_{\mathcal {O}}) \le g1\);
 (ii)
\(\mathcal {O}\sim \mathcal {O}'\) with \(\mathcal {O}'\) a Type B fourientation if and only if \(\mathrm{deg}( D_{\mathcal {O}}) \ge g1\).
Proof
We have that \(\mathrm{deg}(D_{\mathcal {O}}) \le g1\) if and only if \(\mathrm{deg}(D_{\mathcal {O}^c}) \ge g1\), and \(\mathcal {O}\) is Type A if and only if \(\mathcal {O}^c\) is Type B, thus Lemma 4.17 shows that (ii) is equivalent to (i). We now verify (i). It is clear that if \(\mathcal {O}\sim \mathcal {O}'\) with \(\mathcal {O}'\) a type A partial orientation, then \(\mathrm{deg}( D_{\mathcal {O}}) \le g1\). Conversely, suppose \(\mathrm{deg}( D_{\mathcal {O}}) \le g1\) and \(\mathcal {O}\) is not a Type A fourientation. Let S be the set of vertices incident to a bioriented edge and T be the set of edges incident to an unoriented edge. By assumption, both S and T are nonempty. Furthermore, we take \(\overline{S}\) to be the set of vertices which are reachable from S by a (possibly empty) directed path. If \(\overline{S} \cap T \ne \varnothing \), then we may perform a Jacob’s ladder cascade to decrease the number of bioriented edges. By induction on the number of bioriented edges in \(\mathcal {O}\), we can assume that eventually \(\overline{S} \cap T = \varnothing \). Therefore, \((\overline{S}^c, \overline{S})\) is fully oriented toward \(\overline{S}\), and we can reverse this directed cut enlarging \(\overline{S}\). By induction on \(\overline{S}^c\), this process must terminate. \(\square \)
Theorem 3.4 of [5] states that two partial orientations are equivalent in the generalized cycle–cocycle reversal system if and only if their associated divisors are chipfiring equivalent. This extends Gioan’s [27, Proposition 4.13] from total orientations to partial orientations. We now extend this theorem further to the setting of fourientations.
Theorem 4.19
If \(\mathcal {O}\) and \(\mathcal {O}'\) are fourientations, then \(\mathcal {O}\sim \mathcal {O}'\) if and only if \(D_{\mathcal {O}} \sim D_{\mathcal {O}'}\).
Proof
It is clear that if \(\mathcal {O}\) and \(\mathcal {O}'\) are equivalent in the generalized cocycle reversal system, then \(D_{\mathcal {O}} \sim D_{\mathcal {O}'}\). We now demonstrate the converse. Lemma 4.17 in conjunction with the fact that \(D_{\mathcal {O}} \sim D_{\mathcal {O}'}\) if and only if \(D_{\mathcal {O}^c} \sim D_{(\mathcal {O}')^c}\) allows us to assume that \(\mathrm{deg}(D_{\mathcal {O}}) \le g1\). By Lemma 4.18 \(\mathcal {O}\sim \mathcal {O}_1\) and \(\mathcal {O}' \sim \mathcal {O}_2\) such that both \(\mathcal {O}_1\) and \(\mathcal {O}_2\) are Type A fourientations. We know that \(D_{\mathcal {O}} \sim D_{\mathcal {O}_1}\) and \(D_{\mathcal {O}'} \sim D_{\mathcal {O}_2}\), thus by transitivity \(D_{\mathcal {O}_1} \sim D_{\mathcal {O}_2}\). Now by Theorem 3.4 in [5] we have \(\mathcal {O}_1 \sim \mathcal {O}_2\) and again by transitivity \(\mathcal {O}\sim \mathcal {O}'\). \(\square \)
4.3 Indegree sequences of partial orientations
For a fourientation \(\mathcal {O}\) of G, define \(\overline{D}_{\mathcal {O}} :=\sum _{v \in V(G)} \mathrm {indeg}_{\mathcal {O}}(v)(v) \in \mathbb {Z}V(G)\). We call \(\overline{D}_{\mathcal {O}}\) the indegree sequence of \(\mathcal {O}\). Recall the divisor associated with \(\mathcal {O}\) is \(D_{\mathcal {O}} :=\sum _{v \in V(G)} (\mathrm {indeg}_{\mathcal {O}}(v)1)(v) \in \mathbb {Z}V(G)\); the distinction between the divisor associated with a fourientation and its indegree sequence is just one of normalization. As mentioned in the last section, results of the first author imply that studying partial orientations up to “having the same indegree sequence” is the same as studying equivalence classes of partial orientations in the generalized cycle reversal system (specifically, see the discussion above Lemma 4.15). In this subsection, we explore the number of indegree sequences in various classes of partial orientations. We might hope that the number of indegree sequences among partial orientations in a minedge class is also given by a generalized Tutte polynomial evaluation. But, as observed in [4], the number of indegree sequences among all partial orientations of G cannot be a generalized evaluation of the Tutte polynomial of G itself: for example, the path with three edges has 21 indegree sequences among its partial orientations while the star with three edges has 20, but the Tutte polynomials of all trees with n vertices are the same. This also shows that the number of indegree sequences of acyclic partial orientations of G is not a generalized Tutte polynomial evaluation since all partial orientations of a tree are of course acyclic. One way to get around this obstruction is by considering the Tutte polynomial of graphs related to G. Let us denote by \(G^{\bullet }\) the cone over G, which is the graph obtained from G by adding an extra vertex \(v_0\) and connecting it by an edge to every other vertex in G. Note that the cone over the path on three edges and the cone over the star on three edges have different Tutte polynomials. It turns out that the set \(\{\overline{D}_{\mathcal {O}} :\mathcal {O}\text { an acyclic partial orientation of }G\}\) is the set of \((G^{\bullet },v_0)\)parking functions, and thus, the cardinality of this set is \(T_{G^{\bullet }}(1,1)\). Let us first review some terminology (following, e.g., [55]) to explain why this is.
Definition 4.20
Let G be a graph and designate a special sink vertex \(q \in V(G)\). Set \(V^{q}(G) :=V(G) {\setminus } \{q\}\). A (G, q)parking function is an element \(c = \sum _{v \in V^{q}(G)}c_v (v)\) of \(\mathbb {Z}V^{q}(G)\) such that for all \(\varnothing \ne U \subseteq V^{q}(G)\), there is \(u \in U\) with \(0\le c_u < d^G_U(u)\), where \(d^G_U(u) :=\{ e=\{u,v\} \in E(U, V(G){\setminus } U)\}\). We denote the set of (G, q)parking functions by \(\mathrm {PF}(G,q)\). The set of (G, q)parking function inherits a partial order from \(\mathbb {Z}V^{q}(G)\). A maximal (G, q)parking function is one that is maximal among elements of \(\mathrm {PF}(G,q)\) with respect to this order.
Remark 4.21
Let \(G'\) be the graph obtained from G by removing all loops. Observe that \(\mathrm {PF}(G',q) = \mathrm {PF}(G,q)\). Indeed, the Tutte polynomial evaluations we study in this subsection and the next are all of the form \(y^{g}\cdot T_G(x,1/y)\), a quantity which is the same if we replace G by \(G'\). Thus, we will assume without loss of generality in these subsections that \(G=G'\), i.e., that our graph is loopless. All results stated also hold for graphs with loops, except that in Lemma 4.22 we should replace “acyclic total orientations” with “maximalbyinclusion acyclic partial orientations” (since a graph with loops cannot have any acyclic total orientations). The assumption that the graph is loopless means that any acyclic partial orientation of a graph can be extended to an acyclic total orientation.
A source of a total orientation is a vertex with no incoming directed edges. The following lemma, which is the main tool that will allow us to count indegree sequences of partial orientations, is well known.
Lemma 4.22
(See [12, Theorem 3.1]) There is a bijection between acyclic total orientations of G with unique source q and maximal (G, q)parking functions given by \(\mathcal {O}\mapsto (D_{\mathcal {O}})_{\mathbb {Z}V^{q}(G)}\).
Note the unfortunate, but traditional, conflict between the terms sink and source. Here \((\cdot )_{ \mathbb {Z}V^{q}(G)}\) means ignore the \(1\) coefficient of q and treat the expression as an element of \(\mathbb {Z}V^{q}(G)\). The inverse map of the bijection in Lemma 4.22 is essentially given by Dhar’s burning algorithm [23]. By [32, Theorem 7.3], acyclic total orientations of G with unique source q (and consequently, maximal (G, q)parking functions) are enumerated by \(T_G(1,0)\).
Proposition 4.23
(See [35, Proposition 2,4]) The number of indegree sequences of acyclic partial orientations of G is \(T_{G^{\bullet }}(1,1)\).
Proof
Observe that the set \(\{\overline{D}_{\mathcal {O}}:\mathcal {O}\hbox { an acyclic total orientation of } G \}\) is also equal to \(\{(D_{\mathcal {O}})_{V(G)}:\mathcal {O}\) an acyclic total orientation of \(G^{\bullet }\) with unique source \(v_0\}\) and so by Lemma 4.22 the indegree sequences of acyclic total orientations of G are the maximal \((G^{\bullet },v_0)\)parking functions. Then observe \(\{\overline{D}_{\mathcal {O}}:\mathcal {O}\hbox { an acyclic partial orientation of } G \}\) is the same as \(\{c \in \mathbb {Z}V:0 \le c \le \overline{D}_{\mathcal {O}}\) for some acyclic total orientation \(\mathcal {O}\) of \(G\}\) because any acyclic partial orientation can be extended to an acyclic total orientation. It is a simple fact that \(c \in \mathbb {Z}V^{q}(G)\) is a (G, q)parking function if and only if \(0 \le c \le c'\) for some maximal (G, q)parking function \(c'\). Thus indeed the set of \((G^{\bullet },v_0)\)parking functions is \(\{\overline{D}_{\mathcal {O}}:\mathcal {O}\text { an acyclic partial orientation of }G \}\). It is a classical fact (again, see [12]) that for any choice of sink \(q \in V(G)\), the number of (G, q)parking functions is \(T_{G}(1,1)\), the number of spanning trees of G. So the number of indegree sequences of acyclic partial orientations of G is \(T_{G^{\bullet }}(1,1)\). \(\square \)
Proposition 4.24
(See [35, Corollary 2.10]) The number of indegree sequences of cycle neutral partial orientations of G is \(T_{G^{\bullet }}(1,1)\).
Proof
The main result of Hopkins and Perkinson [35, Corollary 2.10] is that for any parameter list \(A \in \mathbb {R}_{>0}^{\mathbb {E}(G)}\) (in the sense of Sect. 4.1) the set of indegree sequences of acyclic partial orientations of G is also equal to \(\{\overline{D}_{\mathcal {O}_R}:R \text { a region of } \Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A)\}\). (See also the work of Mazin [46] extending this result, which was originally proven only for simple graphs, to multigraphs; for more on the connection between parking functions and partial orientations when \(G = K_n\) is the complete graph, see [11].) Therefore by Propositions 4.3 and 4.23 the number of indegree sequences of cycle neutral partial orientations of G is also given by \(T_{G^{\bullet }}(1,1)\). \(\square \)
It would be interesting to see whether we can count indegree sequences for other classes of partial orientations by evaluating the Tutte polynomial of graphs related to G, or by using more complicated expressions involving the Tutte polynomial of G itself. Another way to obtain Tutte polynomial enumerations of indegree sequences for minedge classes of partial orientations is by restricting to special input data. Recall that a partial orientation \(\mathcal {O}\) is qconnected if every vertex \(v \in V^{q}(G)\) is reachable from q, i.e., there is a directed path from q to v for each \(v \in V^{q}(G)\). As mentioned in Sect. 1.1, qconnected (or “initially connected”) fourientations and partial orientations were previously investigated by Gessel and Sagan [26] in the context of depthfirst search. First we consider a slight variation of Proposition 4.23 (which appears implicity in [53] and explicitly in [5, Lemma 5.6] and [51, Theorem 3.10]). The following result in some sense extends Lemma 4.22 to all, not necessarily maximal, Gparking functions, and it follows moreorless immediately from that classical result. Perhaps the main reason why this result did not appear earlier in the literature is simply that many authors consider total orientations to be more well behaved or natural than partial orientations. One of the main goals of this paper is to convince the reader that this instinctual desire to restrict attention to total orientations is not always beneficial.
Proposition 4.25
The number of indegree sequences of acyclic, qconnected partial orientations of G is \(T_G(1,1)\).
Proof
Note that the acyclic, qconnected total orientations of G are the same as the acyclic total orientations of G with unique source q. So thanks to Lemma 4.22, and arguing as in the proof of Proposition 4.23, the set of (G, q)parking functions is also equal to \(\{(D_{\mathcal {O}})_{\mathbb {Z}V^{q}(G)} :\mathcal {O}\hbox { an acyclic}, q \hbox {connected partial orientation of } \mathbb {G}\}\). As before the cardinality of this set is \(T_G(1,1)\). \(\square \)
Recall that we are always assuming our graph G is connected and so in particular G has at least one spanning tree. Choose a sink \(q \in V(G)\) and choose an ordered, qrooted spanning tree T of G. By this we mean that T is a directed spanning tree of G rooted at q, with edges oriented away from q and totally ordered in some way consistent with the partial order of ancestry so that edges closer to q in T are less than those further away. Let us say that \(\mathcal {O}_{\mathrm {ref}}\) and < are compatible with the data of (q, T) if reference orientation \(\mathcal {O}_{\mathrm {ref}}\) is obtained by extending the orientation of the edges of T to all the edges in E(G) arbitrarily, and the edge order < is obtained by extending the order on the edges of T to an order of all the edges in E(G) in some way so that any edge not in T is greater than all edges in T. If \(\mathcal {O}_{\mathrm {ref}}\) and < are compatible with (q, T) then we call the ordered, oriented graph \(\mathbb {G}= (G,\mathcal {O}_{\mathrm {ref}},<)\) a (q, T)connected graph. Let us say that \(\mathbb {G}\) is qconnected if the set of cut connected partial orientations of \(\mathbb {G}\) is equal to the set of qconnected partial orientations of \(\mathbb {G}\). The point of studying (q, T)connected graphs \(\mathbb {G}\) is explained by the following proposition.
Proposition 4.26
(See [4, §3]) If \(\mathbb {G}\) is (q, T)connected then \(\mathbb {G}\) is qconnected.
Proof
Let \(\mathbb {G}=(G,\mathcal {O}_{\mathrm {ref}},<)\) be (q, T)connected and let \(\mathcal {O}\) be a partial orientation of \(\mathbb {G}\). Suppose \(\mathcal {O}\) is not cut connected and let \(\overrightarrow{{Cu}}= (U,U^c)\) be a bad potential cut that witnesses this. Let e be the minimum edge in \(E(\overrightarrow{{Cu}})\). Since \(\overrightarrow{{Cu}}\) is bad we have \(\mathcal {O}_{\mathrm {ref}}(e) = (v,u)\) with \(u \in U\) and \(v \in U^c\). Observe that e belongs to T. Moreover, because T is ordered in a way consistent with ancestry and because its edges are oriented away from q, all the edges in T closer to q than e are between vertices in \(U^c\). Thus, it must be that \(q \in U^c\). But this means that \(u \in U\) is not reachable from q and so \(\mathcal {O}\) is not qconnected. Now suppose \(\mathcal {O}\) is not qconnected. Let U be set of vertices not reachable from q. Then \(\overrightarrow{{Cu}}= (U,U^c)\) is a bad potential cut with respect to the cut connected property: the minimum edge e in \(E(\overrightarrow{{Cu}})\) belongs to T and since \(q \in U^c\) and e is oriented away from q we have \(\mathcal {O}_{\mathrm {ref}}(e) = (v,u)\) with \(u \in U\) and \(v \in U^c\). \(\square \)
Corollary 4.27
Suppose \(\mathbb {G}\) is (q, T)connected. Then the number of indegree sequences of acycliccut connected partial orientations of \(\mathbb {G}\) is \(T_G(1,1)\).
The (q, T)connectedness of \(\mathbb {G}\) is really essential here: the number of indegree sequences of acycliccut connected partial orientations of an arbitrary ordered, oriented graph \(\mathbb {G}= (G,\mathcal {O}_{\mathrm {ref}},<)\) is not necessarily given by \(T_G(1,1)\). In fact, we have the following converse to Proposition 4.26 which justifies restricting our attention to (q, T)connected graphs.
Proposition 4.28
Suppose \(\mathbb {G}= (G,\mathcal {O}_{\mathrm {ref}},<)\) is qconnected. Then there exists an ordered, qrooted spanning tree T such that for any minedge cut property X and any (q, T)connected graph \(\mathbb {G}' = (G,\mathcal {O}_{\mathrm {ref}}',<')\), the set of good fourientations of \(\mathbb {G}\) with respect to X is equal to the set of good fourientations of \(\mathbb {G}'\) with respect to X.^{3}
Proof
 (\(\dag \)):

There is an ordered, qrooted spanning tree T of G such that for any simple cut \({Cu}\) of G the minimum edge e in \(E({Cu})\) with respect to < is the minimum edge in \(E({Cu}) \cap T\) with respect to the tree order and \(\mathcal {O}_{\mathrm {ref}}(e)\) agrees with the orientation of e in T.
Now assume that G has no cut vertices. To construct the appropriate T we build up a chain of vertices \(\{q\} = S_1 \subsetneq S_2 \subsetneq \cdots \subsetneq S_{n} = V(G)\) and \(T_1,\ldots ,T_n\) such that \(T_i\) is an ordered, qrooted spanning tree of \(G[S_i]\) for each \(1 \le i \le n\) and \(T_{i+1}\) is obtained from \(T_i\) by adding \(e_i\), the minimum edge (with respect to <) in \(E(G) {\setminus } E(G[S_i])\). To show that this is possible we need to show that the minimum edge in \(E(G) {\setminus } E(G[S_i])\) never belongs to \(E(G[V(G){\setminus } S_i])\). Suppose to the contrary that for some i the minimum edge in \(E(G) {\setminus } E(G[S_i])\) is \(e_i = \{u,v\}\) with \(u,v \in V(G) {\setminus } S_i\) and \(e_i^{+} = (u,v)\). Since G has no cut vertices, \(G[V(G) {\setminus } \{u\}]\) is connected, and thus, there exists a qconnected partial orientation \(\mathcal {O}_u\) of \(G[V(G) {\setminus } \{u\}]\). Set \(\mathcal {O}:=\mathcal {O}_u \cup \{e^{\pm }:e^{\pm } = (w,u), e \in E(G)\}\). Then \(\mathcal {O}\) remains qconnected, but \(\mathcal {O}\) is not a cut connected partial orientation of \(\mathbb {G}\) because \({Cu}= (V(G) {\setminus } \{u\},\{u\})\) is a bad potential cut. This contradicts the assumption that \(\mathbb {G}\) is qconnected. So indeed the minimum edge \(e_i = \{u,v\}\) in \(E(G) {\setminus } E(G[S_i])\) is always between a vertex \(u \in S_i\) and a vertex \(v \in V(G){\setminus } S_i\). A very similar argument shows that \(\mathcal {O}_{\mathrm {ref}}(e_i) = (u,v)\). Thus, we can construct the desired \(T_i\). Now set \(T :=T_n\). We claim that this T satisfies (\(\dag \)). So let \({Cu}= \{U,U^c\}\) be a simple cut of G and suppose \(e_i\) is the minimum edge in \(E({Cu}) \cap T\). Because \(T_i\) spans \(S_i\) and all the edges in \(T_i\) are less than \(e_i\), we must have that \(S_i \subseteq U\). But then \(E(U,U^c) \subseteq E(G) {\setminus } E(G[S_i])\), so \(e_i\) must be the minimum edge in \(E(U,U^c)\). As mentioned above, \(\mathcal {O}_{\mathrm {ref}}(e_i)\) agrees with the orientation of \(e_i\) in T. Therefore, T satisfies (\(\dag \)). \(\square \)
Remark 4.29
There is an obvious notion of qconnected fourientation as well: we say a fourientation \(\mathcal {O}\) is qconnected if for every \(v \in V^{q}(G)\) there is a potential path from q to v. Note that \(\mathbb {G}\) being qconnected is equivalent to the set of cut connected fourientations of \(\mathbb {G}\) being equal to the set of qconnected fourientations of \(\mathbb {G}\). This is because a fourientation is cut connected (respectively, qconnected) if and only if it contains a cut connected (resp., qconnected) partial orientation. In fact, the minimalcut connected fourientations of \(\mathbb {G}\) under the partial order of containment are “oriented spanning trees” of G; each spanning tree appears exactly once in this set with some orientation. In the case where \(\mathbb {G}\) is qconnected, these minimalcut connected fourientations are precisely the qrooted spanning trees.
Remark 4.30
In contrast to the complicated situation with partial orientations described above, the number of indegree sequences among a minedge class of total orientations is certainly given by a Tutte polynomial evaluation as outlined in Sect. 1.1. In the other direction, it also might be interesting to investigate the number of indegree sequences among fourientations in a minedge class. Again, this value is not necessarily a generalized Tutte polynomial evaluation. However, we can nevertheless sometimes get a simple expression for this value: for instance, it is easily seen that the number of indegree sequences among all fourientations of a graph G is \(\prod _{v \in V(G)} \mathrm {deg}(v)\).
Remark 4.31
For \(\mathbb {G}\) a (q, T)connected graph, the cut minimalcycle minimal total orientations enumerated by \(T_G(1,1)\) become the cycle minimal, qconnected total orientations. These objects are in bijection with their associated divisors which were introduced by Gioan [27] and further investigated by Bernardi [13]. These divisors were rediscovered by An et al. [1], who proved that they are exactly the break divisors of Mikhalkin and Zharkov [49] offset by a chip at q. These break divisors were discovered originally in the context of divisor theory for tropical curves: they provide canonical representatives for the set of divisors of degree g modulo linear equivalence. In particular, this implies that by adding a chip at q to the divisors associated with qconnected partial orientations, we lose all dependence on q. Interestingly, there exist tropical proofs (see [49, Corollary 6.6]) of the existence and uniqueness of break divisors which are not combinatorial in nature.
4.4 Monomizations of power ideals
One can extend the enumeration of (G, q)parking functions via the Tutte polynomial to an expression for the generating function by degree: a famous result of Merino [48] is that \(T_G(1,y) = \sum _{c \in \mathrm {PF}(G,q)} y^{g  \mathrm {deg}(c)}\), where for \(c = \sum _{v \in V^{q}(G)} c_v (v) \in \mathbb {Z}V^{q}(G)\) we define \(\mathrm {deg}(c) :=\sum _{v \in V^{q}(G)} c_v\). (Merino [47] used this interpretation of the Tutte polynomial to resolve a special case of a 1977 conjecture of Stanley [61] about the hvectors of matroid complexes.) Merino’s theorem can also be expressed succinctly using commutative algebra. Fix some field \(\mathbf {k}\) of characteristic zero and let \(R :=\mathbf {k}[x_v:v \in V^{q}(G)]\) be the polynomial ring with generators indexed by nonsink vertices. For \(\varnothing \ne U \subseteq V^{q}(G)\), define \(\mathbf {x}^{U} :=\prod _{u \in U} x_u^{d^G_U(u)}\) where as before we have \(d^G_U(u) :=\{e= \{u,v\} \in E(U,U^c)\}\). Then define the monomial ideal \(I_{(G,q)} :=\langle \mathbf {x}^{U}:\varnothing \ne U\subseteq V^{q}(G)\rangle \). We use the notation \(\mathbf {x}^c :=\prod _{v \in V^{q}(G)} x_v^{c_v}\) for \(c = \sum _{v \in V^{q}(G)} c_v (v) \in \mathbb {N}V^{q}(G)\). It is not difficult to see that a linear basis of \(R/I_{(G,q)}\) is \(\{\mathbf {x}^c:c \text { a } (G,q)\text {parking function}\}\). A restatement of Merino’s theorem is then that the Hilbert series of the Rmodule \(R/I_{(G,q)}\) is \(\mathrm {Hilb}(R/I_{(G,q)};y) = y^{g} \cdot T_G(1,1/y)\).
Motivated by questions in Schubert calculus [57], Postnikov and Shapiro [55] studied the monomial ideal \(I_{(G,q)}\) as well as a deformation of this ideal generated by powers of homogenous linear forms. Specifically, setting \(d^G_U :=\sum _{u \in U} d^G_U(u)\), they defined the power ideal \(J_{(G,q)} :=\langle \left( \sum _{u \in U} x_u\right) ^{d^G_U}:\varnothing \ne U\subseteq V^{q}(G)\rangle \). (Here power ideal means an ideal generated by powers of homogenous linear forms.) One of the main results of [55] is that \(R/I_{(G,q)}\) and \(R/J_{(G,q)}\) have the same Hilbert series. In fact, Postnikov and Shapiro proved something stronger than this: they proved that \(I_{(G,q)}\) is a monomization of \(J_{(G,q)}\). For \(\mathcal {I}\) a monomial ideal of R and \(\mathcal {J}\) any ideal of R, we say that \(\mathcal {I}\) is a monomization of \(\mathcal {J}\) if the standard monomials of \(\mathcal {I}\) (i.e., the monomials in R not in \(\mathcal {I}\)) form a linear basis of \(R/\mathcal {J}\). Of course \(\mathcal {I}\) being a monomizations of \(\mathcal {J}\) implies that \(R/\mathcal {I}\) and \(R/\mathcal {J}\) have the same Hilbert series. Note that for any given \(\mathcal {J}\), a monomization \(\mathcal {I}\) of \(\mathcal {J}\) can in principle be found using the theory of Gröbner bases, but when \(\mathcal {J}\) is a power ideal it is computationally expensive to compute a Gröbner basis of \(\mathcal {J}\) and the resulting Gröbner bases are often “nasty,” e.g., have a large number of elements. The monomizations we discuss here are not initial ideals of their corresponding power ideals with respect to any term order. Nevertheless, \(I_{(G,q)}\) is a very “nice” monomization of \(J_{(G,q)}\): for instance, the generators of \(I_{(G,q)}\) correspond to the generators of \(J_{(G,q)}\) in a natural way, and the group \(\mathrm {Aut}(G,q)\) of automorphisms of G fixing q naturally acts on both \(I_{(G,q)}\) and \(J_{(G,q)}\).
For the complete graph \(G = K_{n}\), Postnikov–Shapiro–Shapiro [56] found such an external monomial ideal \(I^{+1}_{(G,q)}\) (and indeed this external case was the one they were originally interested in). Desjardins [22, §3] extended their construction to obtain an external monomial ideal \(I^{+1}_{(G,q)}\) for any G. Specifically, let \(\prec \) be a total order on \(V^{q}(G)\) and define \(I^{+1}_{(G,q,\prec )} :=\langle x_{\mathrm {min}_{\prec }(U)} \cdot \mathbf {x}^{U}:\varnothing \ne U\subseteq V^{q}(G) \rangle \) where \(\mathrm {min}_{\prec }(U)\) is the minimal element of U according to \(\prec \). Then Desjardins showed \(I^{+1}_{(G,q,\prec )}\) is a monomization of \(J^{+1}_{(G,q)}\). But he also showed that certain assumptions on G were necessary to mimic this construction and obtain an appropriate internal monomial ideal \(I^{1}_{(G,q)}\). We can try to define \(I^{1}_{(G,q,\prec )} :=\langle x_{\mathrm {min}_{\prec }(U)}^{1} \cdot \mathbf {x}^{U}:\varnothing \ne U\subseteq V^{q}(G) \rangle \). However, it is important to observe that \(I^{1}_{(G,q,\prec )}\) does not always make sense because \(x_{\mathrm {min}_{\prec }(U)}^{1} \cdot \mathbf {x}^{U}\) may be a Laurent monomial rather than an honest monomial. But \(I^{1}_{(G,q,\prec )}\) does make sense at least when there is an edge between q and each vertex in \(V^{q}(G)\). Desjardins [22, §4] showed that when G is saturated, i.e., when there is at least one edge between any pair of vertices in V(G), then \(I^{1}_{(G,q,\prec )}\) is a monomization of \(J^{1}_{(G,q)}\) for any choice of \(\prec \).
Here we suggest an approach for finding a monomization of \(J^{1}_{(G,q)}\) for all graphs G using acycliccut positively connected partial orientations. As before, we must work with a (q, T)connected graph \(\mathbb {G}\). For \(\varnothing \ne U \subseteq V^{q}(G)\), define \(\mathbf {x}^{U,T} :=\prod _{u \in U} x_u^{d^{G}_{U,T}(u)}\) with \(d^{G}_{U,T}(u) :=\{ e=\{u,v\} \in E(U,U^c) \hbox { and } e \hbox { is not the minimum edge in } E(U,U^c)\}\). So in particular the degree of \(\mathbf {x}^{U,T}\) is one less than the degree of \(\mathbf {x}^{U}\). Then define the monomial ideal \(I^{1}_{(G,q,T)} :=\langle \mathbf {x}^{U,T}:\varnothing \ne U\subseteq V^{q}(G)\rangle \). Note that an ordered, qrooted spanning tree T of G gives rise to a total order \(\prec _T\) on \(V^{q}(G)\) whereby \(u \prec _T v\) if the minimum edge in T containing u is less than the minimum edge in T containing v. Furthermore, we have \(I^{1}_{(G,q,T)} = I^{1}_{(G,q,\prec _T)}\), and moreover, the total orders \(\prec \) arising from spanning trees in this way are precisely the ones for which \(I^{1}_{(G,q,\prec )}\) does make sense. In analogy to the definition of (G, q)parking functions, let us say \(c \in \mathbb {Z}V^{q}(G)\) is a (G, q, T)internal parking function if \(\mathbf {x}^{c}\) is a standard monomial of \(I^{1}_{(G,q,T)}\). Equivalently, we have the following definition.
Definition 4.32
An element \(c = \sum _{v \in V^{q}(G)}c_v(v) \in \mathbb {Z}V^{q}(G)\) is a (G, q, T)internal parking function if for all \(\varnothing \ne U \subseteq V^{q}(G)\), there is \(u \in U\) with \(0\le c_u < d^{G}_{U,T}(u)\). We denote the set of (G, q, T)internal parking functions by \(\mathrm {PF}^{}(G,q,T)\). (see also [33, Definition 1.5], where Holtz and Ron define internal parking functions in the case of the complete graph \(G=K_{n}\).)
Also, let \(\mathrm {APC}(G,q,T)\) denote the set of acycliccut positively connected partial orientations of \(\mathbb {G}\). (Notice that both \(\mathrm {PF}^{}(G,q,T)\) and \(\mathrm {APC}(G,q,T)\) depend only on the data (G, q, T).) In what follows, rather than study monomizations directly, we concentrate on the easier problem of showing that \(R/I^{1}_{(G,q,T)}\) and \(R/J^{1}_{(G,q)}\) have the same Hilbert series. To that end we put forward the following conjecture.
Conjecture 4.33
 (a)
\(\mathrm {Hilb}\left( R/I^{1}_{(G,q,T)};y\right) = y^{g} \cdot T_G(0,1/y)\);
 (b)
\(\mathrm {PF}^{}(G,q,T) = \{(D_{\mathcal {O}})_{\mathbb {Z}V^{q}(G)}:\mathcal {O}\in \mathrm {APC}(G,q,T) \}\).
Example 4.34
Finding the appropriate tree T for each choice of graph G and sink \(q \in V(G)\) is a major part of resolving Conjecture 4.33. Desjardins [22, Example 21] gave an example that shows statement (a) from Conjecture 4.33 does not always hold for all choices of (G, q, T). That some restrictions on T are necessary should be seen as similar to the fact that we need \(\mathbb {G}\) to be (q, T)connected in order to ensure that the number of indegree sequences of its acycliccut connected partial orientations is \(T_{G}(1,1)\).
We now prove some special cases of Conjecture 4.33. First we upgrade Desjardins’ result about monomizations of the internal power ideal for saturated G to a proof of Conjecture 4.33 for saturated G.
Theorem 4.35
Conjecture 4.33 is true when G is saturated.
Proof
As we already explained, Desjardins showed that statement (a) holds for any choice of T. Thus, we need only show that (b) holds for an appropriate choice of T, which we do now. We will take T to be a star, i.e., the edges of T are \(e=\{q,v\}\) for all vertices \(v \in V^{q}(G)\). The order of the edges of T can be arbitrary. Let < be some edge order compatible with T. In what follows for convenience, we write \(D_\mathcal {O}\) in place of \((D_{\mathcal {O}})_{\mathbb {Z}V^{q}(G)}\) when the choice of sink is clear from context.
First let us show \(\{D_{\mathcal {O}}:\mathcal {O}\in \mathrm {APC}(G,q,T) \} \subseteq \mathrm {PF}^{}(G,q,T)\). So let \(\mathcal {O}\in \mathrm {APC}(G,q,T)\) and set \(c = \sum _{v \in V^{q}(G)}c_v(v) :=D_{\mathcal {O}}\). Suppose to the contrary that \(c \notin \mathrm {PF}^{}(G,q,T)\): specifically, suppose there is some \(U \subseteq V^{q}(G)\) such that \(d^{G}_{U,T}(u) \le c_u\) for all \(u \in U\). Let \(u_0\) be the vertex in U adjacent to the minimal edge in \(E(U,U^c)\). First suppose that there is some \(e \in E(U,U^c)\) with \(e^{\pm } = (v,u_0)\) such that \(e^{\pm } \notin \mathcal {O}\). This means we have \(\{e^{\pm }=(u',u)\in \mathcal {O}:u' \in U, e\in E(G)\} \ge 1\) for each \(u \in U\). But then \(\mathcal {O}\) contains a directed cycle involving vertices in U, contradicting the fact that \(\mathcal {O}\) is acyclic. So now assume that for all \(e \in E(U,U^c)\) with \(e^{\pm } = (v,u_0)\) we have \(e^{\pm } \in \mathcal {O}\). Then if \(\overrightarrow{{Cu}}= (U^c,U)\) is a potential cut, it is a bad potential cut with respect to the cut positively connected property because its minimum edge is oriented. So it cannot be a potential cut. Thus, there must be \(e^{\pm } = (u_1,v_0) \in \mathcal {O}\) with \(u_1 \in U\) and \(v_0 \in U^c\). But also note that \(\{e^{\pm }=(u',u)\in \mathcal {O}:u' \in U, e\in E(G)\} \ge 1\) for each \(u \in U\) with \(u \ne u_0\), which in particular means there is a directed path in \(\mathcal {O}\) from \(u_0\) to \(u_1\) involving vertices in U. Because G is saturated, there is \(e = \{v_1,u_0\} \in E(G)\) and by assumption we have \(e^{\pm } = (v_1,u_0) \in \mathcal {O}\). Therefore, there is a directed cycle in \(\mathcal {O}\) that goes from \(u_1\) to \(v_1\) to \(u_0\) back to \(u_1\), contradicting the fact that \(\mathcal {O}\) is acyclic. So indeed \(c \in \mathrm {PF}^{}(G,q,T)\).
Next let us show \(\mathrm {PF}^{}(G,q,T) \subseteq \{D_{\mathcal {O}}:\mathcal {O}\in \mathrm {APC}(G,q,T) \}\). So let \(c\in \mathrm {PF}^{}(G,q,T)\). We want to find a \(\mathcal {O}\in \mathrm {APC}(G,q,T)\) with \(D_{\mathcal {O}} = c\). To do this, we will apply the Cori–Le Borgne variant [17] of Dhar’s burning algorithm [23]. The algorithm proceeds as follows: we initialize \(\mathcal {O}_0 :=\varnothing \) and \(B_0 :=\{q\}\); at the ith step for \( i=1,\ldots ,\mathrm {deg}(c)+n1 \hbox { we set } \mathcal {O}_{i} :=\mathcal {O}_{i1} \cup \{e^{\pm }\}\), where \(e^{\pm }\) is the maximum edge of \(\mathbb {E}(B_{i1},B_{i1}^c) {\setminus } \mathcal {O}_i\) according to < , and \(B_i :=\{q\} \cup \{v\in V^{q}(G):\mathrm {indeg}_{\mathcal {O}_i}(v)  1 = c_v\}\); our output is \(\mathcal {O}:=\mathcal {O}_{\mathrm {deg}(c)+n1}\). The facts that \(\mathbb {E}(B_{i1},B_{i1}^c) {\setminus } \mathcal {O}_i \ne \varnothing \) at each step, that \(D_{\mathcal {O}} = c\), and that \(\mathcal {O}\) is a qconnected, acyclic partial orientation follow from the correctness of the Cori–Le Borgne algorithm [17] (see also the description of this algorithm given in [8, §5.2]). All we need to show is that \(\mathcal {O}\) is cut neutral. Suppose to the contrary we have a potential cut \(\overrightarrow{{Cu}}= (U,U^c)\) of \(\mathcal {O}\) and \(e_{\mathrm {min}}^{\delta } \in \mathcal {O}\) where \(e_{\mathrm {min}}^{\delta } = (q,v)\) is the minimum edge in \(\mathbb {E}(U,U^c)\) with respect to <. (We know \(e_{\mathrm {min}}\) is of this form because T is a star.) Let i be such that \(\mathcal {O}_i = \mathcal {O}_{i1} \cup \{e^{\delta }\}\). First suppose that \(U \subseteq B_i\). The minimum edge in any cut is of the form \(e=\{q,v'\}\) because T is a star, and since \(\{e=\{q,v'\}:v' \in B_i^c\}\subseteq \{e=\{q,v'\}:v' \in U^c\}\), the minimum edge in \(E(B_i,B_i^c)\) must in fact be \(e_{\mathrm {min}}\). But because we always choose the maximum edge in the cut to add at every step of the algorithm, we must have \(\mathbb {E}(B_i,B_i^c) \subseteq \mathcal {O}\). This in turn means that \(d^{G}_{B_i^c,T}(v') \le \mathrm {indeg}(\mathcal {O})1\) for all \(v' \in B_i^c\), contradicting that \(c \in \mathrm {PF}^{}(G,q,T)\). So now assume \(U {\setminus } B_i \ne \varnothing \). Let j be minimal so that \(\mathcal {O}_j = \mathcal {O}_{j1}\cup \{e_{*}^{\delta _*}\}\) with \(e_{*}^{\delta _*} = (u,w)\) for some \(w \in U {\setminus } B_i\). Such a j exists because \(B_{\mathrm {deg}(c)+n1} = V(G)\). Note that because we added an edge \(e_{\mathrm {min}} \in T\) at step i, it must be that any \(e \in \mathbb {E}(B_i,B_i^{c}) {\setminus } \mathcal {O}_i\) also belongs to T (and is thus incident to q). So if \(u \in B_i\) then \(u = q\) and \(e_{*} \in T\). But in fact because G is saturated there is an edge \(e=\{v,w\} \in E(G)\), and because the algorithm would not choose to add an edge in T when it could add an edge not in T this means \(u \ne q\). Thus \(u \in U^c\), which means \(e^{\delta _*}_{*} = (u,w) \in \mathcal {O}\) with \(u \in U^c\) and \(w \in U\), contradicting the fact that \(\overrightarrow{{Cu}}\) is a potential cut of \(\mathcal {O}\). So indeed \(\mathcal {O}\) is cut neutral. \(\square \)
We will now prove Conjecture 4.33 in a different special case than the case addressed by Desjardins, namely when G is an outerplanar graph. This means that G can be drawn in the plane without crossings in such a way that all of its vertices lie in the boundary of the unbounded face of this drawing. These cases really are quite different: G being saturated means that G is “dense” while G being outerplanar means that G is “sparse.” Also, the techniques we employ are very different from those used by Desjardins. Desjardins employed the theory of Monotone Monomial Ideals developed by Postinkov–Shapiro [55, §5]. Instead, we build on Merino’s deletion–contraction proof [48] of his famous theorem. We remark that the ideals \(I_{(G,q,T)}\) we obtain for outerplanar G are in general not Monotone Monomial Ideals.
Proposition 4.36
Let G be a graph, \(q \in V(G)\) a sink, and T an ordered, qrooted spanning tree of G. Let \(e \in E(G)\) be an isthmus. Then \(\mathrm {Hilb}(R/I^{1}_{(G,q,T)};y) = 0\).
Proof
Let \(\{U,U^c\}\) be the cut such that \(E(U,U^c) = \{e\}\) and \(q \in U^c\). Then \(\mathbf {x}^{U,T} = 1\), so \(R/I^{1}_{(G,q,T)} = 0\). \(\square \)
Proposition 4.37
Let G be a graph, \(q \in V(G)\) a sink, and T an ordered, qrooted spanning tree of G. Let \(e \in E(G)\) be a loop. Then \(\mathrm {Hilb}(R/I^{1}_{(G,q,T)};y) = \mathrm {Hilb}(R/I^{1}_{(G/e,q,T)};y)\).
Proof
This is trivial: loops do not affect \(d^{G}_{U,T}(u) \) for any \(u \in U \subseteq V^{q}(G)\), so in fact we have \(I^{1}_{(G,q,T)} = I^{1}_{(G/e,q,T)}\). \(\square \)
Lemma 4.38
Let G be a graph, \(q \in V(G)\) a sink, and T an ordered, qrooted spanning tree of G. Let \(e = \{q,v\} \in E(G)\) be some nonloop edge that does not belong to T. Then \(\mathrm {Hilb}(R/I^{1}_{(G,q,T)};y) = \mathrm {Hilb}(R/(I^{1}_{(G/e,q,T/e)}+ \langle x_v \rangle );y)+y\cdot \mathrm {Hilb}(R/I^{1}_{(G{\setminus } e,q,T {\setminus } e)};y)\).
Proof

if G is the graph with one vertex and no edges, then \((G,q,T) \in \mathcal {G}\);

if there exists \(e \in E(G)\) with e an isthmus, then \((G,q,T) \in \mathcal {G}\);

if there exists \(e \in E(G)\) with e a loop and \((G/e,q,T) \in \mathcal {G}\), then \((G,q,T) \in \mathcal {G}\);

if there exists a nonloop \(e = \{q,u\} \in E(G)\) with \(e \notin T\) and if \((G/e,q,T/e) \in \mathcal {G}\) and \((G{\setminus } e,q,T {\setminus } e) \in \mathcal {G}\), then \((G,q,T) \in \mathcal {G}\).
Corollary 4.39
\(\mathrm {Hilb}(I^{1}_{(G,q,T)};y) = y^{g} \cdot T_G(0,1/y)\) for \((G,q,T) \in \mathcal {G}\).
Lemma 4.40
\(\mathrm {PF}^{}(G,q,T) = \{(D_{\mathcal {O}})_{\mathbb {Z}V^{q}(G)}:\mathcal {O}\in \mathrm {APC}(G,q,T) \}\) for \((G,q,T) \in \mathcal {G}\).
Proof
We will prove this by induction on the number of edges of G. If \(e \in E(G)\) is an isthmus, then both sets are empty. If \(e \in E(G)\) is a loop, then, as mentioned earlier, the loop e has no effect on the set of internal parking functions and also e must be neutral in any \(\mathcal {O}\in \mathrm {APC}(G,q,T)\), so the claim reduces to the same claim for (G / e, q, T). If G is the graph on one vertex and no edges, then both sets are equal to \(\{0\}\). Thus, we may assume G has no isthmuses and loops, that there is \(e = \{q,v\} \in E(G)\) with \(e \notin T\), and by induction that the claim holds for (G / e, q, T / e) and \((G {\setminus } e, q, T {\setminus } e)\). In what follows for convenience we write \(D_\mathcal {O}\) in place of \((D_{\mathcal {O}})_{\mathbb {Z}V^{q}(G)}\) when the choice of sink is clear from context.
First let us show \(\mathrm {PF}^{}(G,q,T) \subseteq \{D_{\mathcal {O}}:\mathcal {O}\in \mathrm {APC}(G,q,T) \}\). So let \(c \in \mathrm {PF}^{}(G,q,T)\). By the proof of Lemma 4.38, we know that either the coefficient of (v) in c is 0 and we have \(c \in \mathrm {PF}^{}(G/e,q,T/e)\), or else \(c  (v) \in \mathrm {PF}^{}(G{\setminus } e, q, T {\setminus } e)\). Assume we are in the first case where the coefficient of (v) in c is 0. By induction, we can find a partial orientation \(\mathcal {O}' \in \mathrm {APC}(G/e,q,T/e)\) with \(D_{\mathcal {O}'} = c\). Define \(\mathcal {O}:=\mathcal {O}' \cup \{e^{\delta } = (q,v)\}\). Then \(D_{\mathcal {O}} = c\). We claim that \(\mathcal {O}\in \mathrm {APC}(G,q,T)\). Clearly \(\mathcal {O}\) remains acyclic and qconnected. Let us show it is cut neutral. So assume there is a potential cut \(\overrightarrow{{Cu}}\) for \(\mathcal {O}\) that is bad for the cut neutral property. First suppose \({Cu}= (\{q\} \cup U_1, \{v\} \cup U_2)\). Then note that the only edge in \(E(\overrightarrow{{Cu}})\) adjacent to v that is oriented in \(\mathcal {O}\) is e, but e it is not in T and so cannot be the minimum edge in \(E(\overrightarrow{{Cu}})\) and the minimum edge of any bad potential cut must be oriented. Thus, there is some edge in \(E(\overrightarrow{{Cu}})\) that is less than any edge in \(E(\overrightarrow{{Cu}})\) adjacent to v. Therefore, \((\{q,v\} \cup U_1, U_2)\) is also bad. So we may assume that \(\overrightarrow{{Cu}}= (\{q,v\} \cup U_1, U_2)\). But then by the key claim (*) in the proof of Lemma 4.38 the minimum edge of \(\overrightarrow{{Cu}}' :=(\{q\} \cup U_1, U_2)\) is also the minimum edge of \(\overrightarrow{{Cu}}\), so \(\overrightarrow{{Cu}}'\) is a bad potential cut of \(\mathcal {O}'\), a contradiction. Thus indeed \(\mathcal {O}\) is cut neutral. Next assume we are in the second case where the coefficient of (v) is greater than 0. Again by induction we can find \(\mathcal {O}'' \in \mathrm {APC}(G{\setminus } e,q,T {\setminus } e)\) with \(D_{\mathcal {O}''} = c  (v)\). Define \(\mathcal {O}:=\mathcal {O}'' \cup \{e^{\delta } = (q,v)\}\). Then \(D_{\mathcal {O}} = c\). Furthermore, we have \(\mathcal {O}\in A(G,q,T)\): clearly \(\mathcal {O}\) remains acyclic and qconnected, and it is cut neutral because e is never the minimum edge in a cut.
Now let us show \(\{D_{\mathcal {O}} :\mathcal {O}\in \mathrm {APC}(G,q,T) \} \subseteq \mathrm {PF}^{}(G,q,T)\). So let \(\mathcal {O}\in \mathrm {APC}(G,q,T)\). If \(e^{\delta } = (q,v) \notin \mathcal {O}\), then \(\mathcal {O}\cup \{e^{\delta }\} \in \mathrm {APC}(G,q,T)\): certainly \(\mathcal {O}\) remains acyclic and qconnected, and it is still cut neutral because e is never the minimum edge in a cut. Moreover, if we show \(D_{\mathcal {O}\cup \{e^{\delta }\}} \in \mathrm {PF}^{}(G,q,T)\) this will show \(D_{\mathcal {O}} \in \mathrm {PF}^{}(G,q,T)\) because \(0 \le D_{\mathcal {O}} \le D_{\mathcal {O}\cup \{e^{\delta }\}}\) and the set of internal parking functions is downward closed: that is, if \(0 \le c \le c'\) with \(c'\) a internal parking function, then c is a internal parking function. So now assume that \(e^{\delta } \in \mathcal {O}\). First suppose that \(e^{\delta }\) is the only oriented edge in \(\mathcal {O}\) pointing into v. Then we claim that \(\mathcal {O}/e \in \mathrm {APC}(G/e,q,T/e)\): it is easy to see that this orientation is acyclic and qconnected, and any bad potential cut for the cut neutral property for \(\mathcal {O}/e\) lifts to a bad potential cut of \(\mathcal {O}\) because by the key claim (*) in the proof of Lemma 4.38 when q and v are on the same side of a cut the minimum edge of this cut is the same in G and G / e. Now assume that there is at least one other oriented edge pointing to v. Then by walking backwards from v along this edge we see that there is another directed path from q to v that does not use e. We claim that in this case \(\mathcal {O}{\setminus } e \in \mathrm {APC}(G{\setminus } e, q, T{\setminus } e)\): again it is clearly acyclic and qconnected, and it is cut neutral because in any cut that e belonged to, we must have another oriented edge in the same direction coming from the other path from q to v. But then by induction we know that \(D_{\mathcal {O}/e} \in \mathrm {PF}^{}(G/e,q,T/e)\) or \(D_{\mathcal {O}{\setminus } e} \in \mathrm {PF}^{}(G{\setminus } e,q,T{\setminus } e)\), and so by the proof of Lemma 4.38, we know that \(D_{\mathcal {O}} \in \mathrm {PF}^{}(G,q,T)\). \(\square \)
Lemma 4.41
If G is an outerplanar graph, \(q \in V(G)\) is a choice of sink, and T is a qrooted boundary tree, then \((G,q,T) \in \mathcal {G}\).
Proof
The proof is by induction on the number of edges of G. The case where G has one vertex and no edges is trivial. If G has a loop e at q, then we can contract e and T is still a qrooted boundary tree of the outerplanar graph G / e, so by induction \((G/e,q,T) \in \mathcal {G}\) and thus \((G,q,T) \in \mathcal {G}\) by the definition of \(\mathcal {G}\). Suppose all edges containing q in E(G) belong to T: then we claim G has an isthmus e. Indeed, this can happen only if as we are walking along the boundary we walk along an edge \(e^{\delta } = (q,v)\) and then later walk along \(e^{\delta }\); in this case, e must be an isthmus. So in this case \((G,q,T) \in \mathcal {G}\).
Thus, we can assume that there is some nonloop \(e = \{q,v\}\) with \(e \notin T\), and we can assume that e is chosen to be the “leftmost” such edge, i.e., it is the last one we walk along when walking along the boundary of G. Then we claim that T / e and \(T {\setminus } e\) remain qrooted boundary trees of the outerplanar graphs G / e and \(G{\setminus } e\), respectively. First consider T / e: we can take the drawing that verifies T is a qrooted boundary tree and “squish” e in this drawing to obtain a drawing of G / e; then (neglecting any loops produced, which are irrelevant) if we walk counterclockwise from q around the boundary of this drawing of G / e we walk along the same edges in the same order as in the walk for T; so this drawing verifies that T / e is also a qrooted boundary tree. Now consider \(T{\setminus } e\): again, we take the drawing for T and delete e from the drawing to obtain a drawing of \(G{\setminus } e\); now as we walk counterclockwise from q along the boundary of this drawing of \(G {\setminus } e\) we may walk along some new edges after we visit v, but we will have already visited all vertices at that point; so this drawing verifies that \(T{\setminus } e\) is also a qrooted boundary tree. Therefore by induction \((G/e,q,T/e), (G{\setminus } e,q,T{\setminus } e) \in \mathcal {G}\), which means \((G,q,T) \in \mathcal {G}\) by the definition of \(\mathcal {G}\). \(\square \)
Theorem 4.42
Conjecture 4.33 is true when G is outerplanar.
Proof
Let \(q \in V(G)\). Certainly there exists a qrooted boundary tree T. Then by Lemma 4.41 we have \((G,q,T) \in \mathcal {G}\). So statement (a) of Conjecture 4.33 holds by Corollary 4.39, and statement (b) holds by Lemma 4.40. \(\square \)
Remark 4.43
Gessel and Sagan [26] count the number of acyclic partial orientations of G by decomposing the poset of acyclic partial orientations into a number of intervals equal to the number of forests of G. The interval corresponding to a forest F is a Boolean lattice of order \(E{\setminus } (F \cup L(F))\) where L(F) denotes the set of externally active edges in F as in Sect. 3.5 (albeit with a slightly different notion of external activity that is based on depthfirst search). The partial orientations belonging to an interval corresponding to a spanning tree are precisely the acyclic, qconnected partial orientations. It should be possible to fit the acycliccut positively connected partial orientations into this story: in particular, they should be precisely the partial orientations that belong to an interval corresponding to a spanning tree with no internal activity. Indeed, extending the interval decomposition of [26] in this manner seems like a promising approach to proving Conjecture 4.33. The main issue is that there are so many choices of data, including even which notion of activity to use.
 (a)
Initialize \(i:=0\).
 (b)
Set \(v_i :=\mathrm {min}^{\prec }(V {\setminus } (\Pi ^{\prec }_0(\mathcal {O})\cup \cdots \cup \Pi ^{\prec }_{i1}(\mathcal {O}) ) )\).
 (c)
Set \(\Pi _i :=\{v \in V(G):v \text { is reachable from }v_i\hbox { in }\mathcal {O}\} {\setminus } (\Pi ^{\prec }_0(\mathcal {O})\cup \cdots \cup \Pi ^{\prec }_{i1}(\mathcal {O}) )\).
 (d)
If \(V(G) \ne \Pi ^{\prec }_0(\mathcal {O})\cup \cdots \cup \Pi ^{\prec }_{i}(\mathcal {O})\), set \(i:=i+1\) and go to (b). Otherwise terminate.
 (1)
\(\bigsqcup _{F {\text {a forest of }} G} \, [\mathcal {O}_{\mathrm {min}}(F),\mathcal {O}_{\mathrm {max}}(F)]\) is a decomposition of the poset of acyclic partial orientations of G into \(T_G(2,1)\) Boolean intervals;
 (2)
\(\bigsqcup _{T {\text {a span. tree of }} G} \, [\mathcal {O}_{\mathrm {min}}(T),\mathcal {O}_{\mathrm {max}}(T)]\) is a decomposition of the poset of acyclic, qconnected partial orientations of G into \(T_G(1,1)\) Boolean intervals;
 (3)
\(F \mapsto \mathbf {x}^{\widetilde{D}^{\prec }_{\mathcal {O}_\mathrm {max}(F)}}\) bijects forests and standard monomials of \(I^{+1}_{(G,q,\prec )}\);
 (4)
\(T \mapsto \mathbf {x}^{\widetilde{D}^{\prec }_{\mathcal {O}_\mathrm {max}(T)}}\) bijects spanning trees and standard monomials of \(I_{(G,q)}\).
Remark 4.44
Recently, there has been a great deal of interest in understanding minimal free resolutions of \(I_{(G,q)}\) and minimal free resolutions of a certain binomial ideal for which \(I_{(G,q)}\) is a distinguished initial ideal [24, 34, 44, 45, 51–53] [54, §7]. It would be interesting to find a combinatorial description of a minimal free resolution of \(I^{1}_{(G,q,T)}\) or to compute its Betti numbers combinatorially. For that matter, it would be interesting to similarly investigate free resolutions of the external monomial ideal \(I^{+1}_{(G,q,\prec )}\), which apparently have not been studied. Note that Postnikov and Shapiro [55, Conjecture 6.10] have conjectured that the graded Betti numbers of \(J_{(G,q)}\) and \(I_{(G,q)}\) coincide, but apparently understanding minimal free resolutions of \(J_{(G,q)}\) is a very difficult problem (see, e.g., [58, 59]).
4.5 (Co)graphic Lawrence ideals
As in Remark 4.12, let \(W \simeq \mathbb {R}^{E(G)}\) be the vector space with basis elements \(x_{e^+} = x_{e^} \) for \(e \in E(G)\). Consider the lattice \(\mathbb {Z}^{E(G)}\) inside of W. Given \(u = \sum _{e \in E(G)} c_e (x_{e^+}) \in \mathbb {Z}^{E(G)}\), let us define \(u^+ :=\sum _{c_e \ge 0} c_e (x_{e^+})\) and \(u^ := \sum _{c_e \le 0} c_e (x_{e^+})\) to be the positive and negative parts of u. Fix a field \(\mathbf {k}\) and let \(S = \mathbf {k}[y^{+}_e,y^{}_e:e \in E(G)]\) be a polynomial ring in 2E(G) variables. To a lattice element \(u \in \mathbb {Z}^{E(G)}\), we associate a binomial \(b(u) :=y_{+}^{u^+}y_{}^{u^}  y_{}^{u^+}y_{+}^{u^} \in S\), where we use the notation \(y_{\pm }^{c} :=\prod _{e \in E(G)} (y^{\pm }_e)^{c_e}\) for \(c = \sum _{e \in E(G)} c_e (x_{e^+}) \in \mathbb {N}^{E(G)}\). Let L be a sublattice of \(\mathbb {Z}^{E(G)}\). To L we associate the binomial Lawrence ideal \(I_L :=\langle b(u) : u \in L \rangle \).
Recall that for a directed cut or cycle \(\overrightarrow{{C}}\) of G we defined \(x_{\overrightarrow{{C}}} :=\sum _{e^{\pm } \in \mathbb {E}(\overrightarrow{{C}})}x_{e^{\pm }} \in W\). We define the cut lattice of \((G,\mathcal {O}_{\mathrm {ref}})\) to be \(\langle x_{\overrightarrow{{Cu}}}: \overrightarrow{{Cu}}\text { is a directed cut} \rangle _{\mathbb {Z}}\) and the cycle lattice to be \(\langle x_{\overrightarrow{{Cy}}}: \overrightarrow{{Cy}}\text { is a directed cycle } \rangle _{\mathbb {Z}}\). See [3] for a more organic homological description of the cut and cycle lattices. The graphic and cographic Lawrence ideals, which we will denote \(I^{\overrightarrow{{Cu}}}_{(G,\mathcal {O}_{\mathrm {ref}})}\) and \(I^{\overrightarrow{{Cy}}}_{(G,\mathcal {O}_{\mathrm {ref}})}\), are the Lawrence ideals associated with the cut and cycle lattices, respectively. The observation which relates these ideals to cycle/cocycle reversal systems is the following: we can encode a fourientation \(\mathcal {O}\) of G as a squarefree monomial \(y^{\mathcal {O}} :=\prod _{e^{\pm } \in \mathcal {O}} y^{\pm }_e \in S\); then multivariate division of \(y^{\mathcal {O}}\) by some \(b(x_{\overrightarrow{{Cy}}}) (b(x_{\overrightarrow{{Cu}}}))\) corresponds to a (co)cycle reversal of \(\overrightarrow{{Cy}}(\overrightarrow{{Cu}})\) in \(\mathcal {O}\). These ideals have been previously studied in the context of algebraic combinatorics and algebraic statistics [10, 25, 38, 51–53]. A theorem of Sturmfels [64, Theorem 7.1] about binomial generating sets for Lawrence ideals implies that \(\{ b(x_{\overrightarrow{{Cu}}}): \overrightarrow{{Cu}}\text { is a directed cut} \}\) and \(\{ b(x_{\overrightarrow{{Cu}}}): \overrightarrow{{Cy}}\text { is a directed cycle} \}\) are universal Gröbner bases for the ideals that they generate.
Proposition 4.45
Proof
We recall that Gessel and Sagan [26] obtained the generating function for cut connected fourientations of \(\mathbb {G}\) by size in the case where \(\mathbb {G}\) is (q, T)connected. Their result could be used in the proof of Proposition 4.45 instead of Theorem 2.14. In fact, the aforementioned theorem of Sturmfels implies that this generating function is the same for all choices of total order and reference orientation.
Let \(\mathfrak {o} :=\langle \{y_e^{+}y_e^{}:e \in E(G)\}\rangle \), an ideal of S. Tensoring with \(S/\mathfrak {o}\) is the algebraic version of passing from fourientations to partial orientations: it kills bioriented edges. We can compute the Hilbert series of \(S/\mathrm {in}_{<}(I^{\overrightarrow{{Cu}}}_{(G,\mathcal {O}_{\mathrm {ref}})}) \otimes _S S/\mathfrak {o} (S/\mathrm {in}_<(I^{\overrightarrow{{Cy}}}_{(G,\mathcal {O}_{\mathrm {ref}})}) \otimes S/\mathfrak {o})\) in terms of the Tutte polynomial using cut (cycle) minimal partial orientations.
Proposition 4.46
Proof
4.6 The reliability polynomial
Theorem 4.47
Let k, l, and m be nonnegative real numbers with \(2k+l+m=1\). The probability that a (k, l, m)fourientation of G is cut connected is \(R_G(p)\) where \(p :=k+l\).
Proof
For a fixed probability p, Theorem 4.47 gives a oneparameter family of combinatorial interpretations of \(R_G(p)\): if we choose some probability \(0< p < 1\) and some parameter \(t \in \left[ \mathrm {max}\left( \frac{1}{p}, \, \frac{1}{1p}\right)  2,\infty \right) \) then there are unique nonnegative real numbers k, l, and m with \(2k+l+m=1\) such that \(p = k+l\) and \(t = \frac{l+m}{k}\). We now present some specializations of Theorem 4.47, the first of which shows that we can recover the classical description of \(R_G(p)\).
Corollary 4.48
By setting \(k=0\) in Theorem 4.47 we recover the classical description of the reliability polynomial.
Proof
If \(k=0\), then the random fourientation will contain only bioriented edges and unoriented edges. We can consider these objects as random subgraphs by saying that a bioriented edge is “present” and an unoriented edge is “absent” as in Sect. 3.4. In this situation, the fourientation is cut connected precisely when the subgraph is spanning in the sense of Sect. 3.4. \(\square \)
The following specialization recovers a result of the first author.
Corollary 4.49
[4, Theorem 5.1] Let \(0 \le p \le 1/2\). Then there are unique nonnegative real numbers k and m with \(2k+m = 1\) such that \(p = k\). In this case, \(R_G(p)\) is the probability that a (k, 0, m)fourientation of G is cut minimal when viewed as a partial orientation in the sense of Sect. 3.1.
At the time of writing [4] it seemed odd that the probability was restricted to lie between 0 and 1 / 2, and that something else must lie on “the other side of 1 / 2”. The following dual specialization clarifies this strange range restriction.
Corollary 4.50
Let \(1/2 \le p \le 1\). Then there are unique nonnegative real numbers k and l with \(2k+l = 1\) such that \(p = k+l\). In this case, \(R_G(p)\) is the probability that a (k, l, 0)fourientation of G is cut connected when viewed as a partial orientation in the sense of Sect. 3.1.
The first author’s result Corollary 4.49 was inspired by the work of the second author and Perkinson who showed the following.
Proposition 4.51
[35, Corollary 3.3] Let G be a planar graph and \(G^*\) be its planar dual. Let \(A \in \mathbb {R}_{>0}^{\mathbb {E}(G)}\) be a generic parameter list in the sense of Sect. 4.1. The probability that a partial orientation of G chosen uniformly at random is Aadmissible is \(R_{G^{*}}(2/3)\).
Let us clarify the relationship between Proposition 4.51 and Theorem 4.47. Recall from Sect. 4.1 that the exponential parameter list \(A^{<}\) is generic and that being \(A^{<}\)admissible is the same as being cycle neutral. This property is planar dual to cut neutral (which was studied in Sect. 4.1 in relation to the cobigraphical arrangement). Although the two sets of partial orientations are not equal, the number of cut neutral partial orientations is equal to the number of cut connected partial orientations by Theorem 2.14 and so Proposition 4.51 follows from Corollary 4.50.
Remark 4.52
Let \(0 \le p \le 1\). Let \(\mathcal {O}_D\) be a random fourientation obtained in the following manner: independently for each \(e \in E(G)\) and each \(\delta \in \{+,\}\), include \(e^{\delta }\) in \(\mathcal {O}_D\) with probability \((1p)\) and exclude \(e^{\delta }\) from \(\mathcal {O}_D\) with probability p. Let \(\mathcal {O}_U\) be a different random fourientation obtained as follows: independently for each \(e \in E(G)\), include both \(e^{+}\) and \(e^{}\) in \(\mathcal {O}_U\) with probability \((1p)\) and exclude both \(e^{+}\) and \(e^{}\) from \(\mathcal {O}_U\) with probability p. Theorem 4.47 implies that the probability that \(\mathcal {O}_D\) is cut connected is the same as the probability that \(\mathcal {O}_U\) is cut connected and in fact they are both equal to \(R_G(p)\): for \(\mathcal {O}_D\) we take \((k,l,m) :=(p(1p),p^2,(1p)^2)\) and for \(\mathcal {O}_U\) we take \((k,l,m) :=(0,p,(1p))\). Suppose \(\mathbb {G}\) is (q, T)connected for some choice of sink \(q\in V(G)\). Our claims about \(\mathcal {O}_D\) and \(\mathcal {O}_U\) can be reinterpreted as follows. Let \(G_D\) be the directed graph obtained from G by including the directed edges (u, v), (v, u) in \(G_D\) for each \(e = \{u,v\} \in E(G)\). Remove each directed edge from \(G_D\) independently with probability p; from the above claim about \(\mathcal {O}_D\) we conclude that the probability the resulting “subdigraph” is qconnected is \(R_G(p)\). On the other hand, as explained in Corollary 4.48, the claim about \(\mathcal {O}_U\) just amounts to the classical definition of the reliability polynomial. Thus, we see that the “directed” and “undirected” system reliability models have the same probability of failure. The connection between partial orientations and system reliability, and especially this intriguing fact that the “directed” and “undirected” system reliability models corresponding to a graph G have the same probability of failure, were recently explored by Mohammadi [51]. For more on the relationship between the Tutte polynomial of G and analogs of the Tutte polynomial for \(G_D\), see [31, Proposition 4.8].
Acknowledgements
We thank Olivier Bernardi for some enlightening discussions about the Tutte polynomial and for his encouragement with our investigation of fourientations. We thank Criel Merino for explaining the precise statement of the recipe theorem to us. The second author thanks Farbod Shokrieh for suggesting the use of exponential parameters during the 2013 AIM workshop on generalizations of chipfiring and the critical group. The first author thanks Dave Perkinson for early discussions about partial orientations. We thank Lorenzo Traldi for helpful discussions about (closed forms of) the Tutte polynomial. We also thank the two anonymous referees for careful attention to our manuscript and helpful comments. The first author was partially supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/20072013)/ERC Grant Agreement No. 279558, and the Center for Application of Mathematical Principles at the National Institute of Mathematical Sciences in South Korea during the Summer 2014 Program on Applied Algebraic Geometry. The second author was partially supported by NSF Grant #1122374. Finally, the first author would like to thank the MIT Mathematics Department for their hospitality during visits to the second author.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

\(\varphi (G^2)(\eta (e)) = \nu (\varphi (G^1)(e))\);

\(\mathcal {O}_{\mathrm {ref}}^2(\eta (e)) = \nu (\mathcal {O}_{\mathrm {ref}}^1(e))\);

\(e <^1 e'\) if and only if \(\eta (e) <^2 \eta (e')\);

\(e^{\pm } \in \mathcal {O}^1\) if and only if \(\eta (e)^{\pm } \in \mathcal {O}^2\).
In the case of the bigraphical arrangement, if e is a loop we did not include hyperplanes \(H_{e^{\pm }}\) for e because they would lead to contradictory equations, but we can in fact consider these as hyperplanes “at infinity” and thus treat any region as “between” \(H_{e^{+}}\) and \(H_{e^{}}\). Thus, a loop will always be neutral in \(\mathcal {O}_R\) for R a region of \(\Sigma _{(G,\mathcal {O}_{\mathrm {ref}})}(A)\). It can similarly be seen that an isthmus will always be neutral in \(\mathcal {O}_R\) for R a region of \(\Sigma ^{*}_{(G,\mathcal {O}_{\mathrm {ref}})}(A)\).
For \(\mathcal {O}\) a fourientation of \(\mathbb {G}\) and \(\mathcal {O}'\) a fourientation of \(\mathbb {G}'\), we write \(\mathcal {O}= \mathcal {O}'\) to mean that we have an equality of multisets \(\{\mathcal {O}_{\mathrm {ref}}(e^{\pm }):e^{\pm } \in \mathcal {O}\} = \{\mathcal {O}_{\mathrm {ref}}'(e^{\pm }):e^{\pm } \in \mathcal {O}'\}\).
It has previously been observed by Manjunath and Sturmfels [45] that Alexander duality for the Gparking function ideal \(I_{(G,q)}\) is closely related to Riemann–Roch duality. When we instead work with edge variables rather than vertex variables, Alexander duality with respect to \(y^{\mathbb {E}(G)}\) is precisely Riemann–Roch duality.
Declarations
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
 An, Y., Baker, M., Kuperberg, G., Shokrieh, F.: Canonical representatives for divisor classes on tropical curves and the matrixtree theorem. Forum Math. Sigma 2(e24), 25 (2014)MathSciNetMATHGoogle Scholar
 Ardila, F., Postnikov, A.: Combinatorics and geometry of power ideals. Trans. Am. Math. Soc. 362(8), 4357–4384 (2010)MathSciNetView ArticleMATHGoogle Scholar
 Bacher, R., de la Harpe, P., Nagnibeda, T.: The lattice of integral flows and the lattice of integral cuts on a finite graph. Bull. Soc. Math. France 125(2), 167–198 (1997)MathSciNetView ArticleMATHGoogle Scholar
 Backman, S.: Partial graph orientations and the Tutte polynomial. arXiv:1408.3962. Forthcoming, Adv. Appl. Math. (Aug 2014)
 Backman, S.: Riemann–Roch theory for graph orientations. Adv. Math. 309, 655–691 (2017)MathSciNetView ArticleMATHGoogle Scholar
 Backman, S., Hopkins, S., Traldi, L.: Fourientation activities and the Tutte polynomial. arXiv:1512.01821. Forthcoming, Eur. J. Combin. (Dec 2015)
 Baker, M., Norine, S.: Riemann–Roch and Abel–Jacobi theory on a finite graph. Adv. Math. 215(2), 766–788 (2007)MathSciNetView ArticleMATHGoogle Scholar
 Baker, M., Shokrieh, F.: Chipfiring games, potential theory on graphs, and spanning trees. J. Comb. Theory Ser. A 120(1), 164–182 (2013)MathSciNetView ArticleMATHGoogle Scholar
 Bari, R.A.: Chromatic polynomials and the internal and external activities of Tutte. In: Graph Theory and Related Topics (Proceeding Conference, University of Waterloo, Waterloo, ON, 1977), pp. 41–52. Academic Press, New York (1979)Google Scholar
 Bayer, D., Popescu, S., Sturmfels, B.: Syzygies of unimodular Lawrence ideals. J. Reine Angew. Math. 534, 169–186 (2001)MathSciNetMATHGoogle Scholar
 Beck, M., Berrizbeitia, A., Dairyko, M., Rodriguez, C., Ruiz, A., Veeneman, S.: Parking functions, Shi arrangements, and mixed graphs. Am. Math. Mon. 122(7), 660–673 (2015)MathSciNetView ArticleMATHGoogle Scholar
 Benson, B., Chakrabarty, D., Tetali, P.: \(G\)parking functions, acyclic orientations and spanning trees. Discrete Math. 310(8), 1340–1353 (2010)MathSciNetView ArticleMATHGoogle Scholar
 Bernardi, O.: Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings. Electron. J. Combin. 15(1), Research Paper 109 (2008)Google Scholar
 Chebikin, D., Pylyavskyy, P.: A family of bijections between \(G\)parking functions and spanning trees. J. Combin. Theory Ser. A 110(1), 31–41 (2005)MathSciNetView ArticleMATHGoogle Scholar
 Chen, B., Yang, A.L.B., Zhang, T.Y.J.: A bijection for Eulerianequivalence classes of totally cyclic orientations. Gr. Combin. 24(6), 519–530 (2008)MathSciNetView ArticleMATHGoogle Scholar
 Cools, F., Draisma, J., Payne, S., Robeva, E.: A tropical proof of the Brill–Noether theorem. Adv. Math. 230(2), 759–776 (2012)MathSciNetView ArticleMATHGoogle Scholar
 Cori, R., Le Borgne, Y.: The sandpile model and Tutte polynomials. Adv. Appl. Math. 30(1–2), 44–52 (2003)MathSciNetView ArticleMATHGoogle Scholar
 Corry, S., Perkinson, D.: Divisors and sandpiles. In: The AMS Student Mathematical Library Series (2017). Book in progress; draft available online at http://people.reed.edu/~davidp/divisors_and_sandpiles/
 Courtiel, J.: A general notion of activity for the Tutte polynomial. arXiv:1412.2081 (Dec 2014)
 Dahmen, W., Micchelli, C.A.: On the local linear independence of translates of a box spline. Stud. Math. 82(3), 243–263 (1985)MathSciNetMATHGoogle Scholar
 De Concini, C., Procesi, C.: Hyperplane arrangements and box splines. Mich. Math. J. 57, 201–225 (2008). With an appendix by A. Björner, Special volume in honor of Melvin HochsterMathSciNetView ArticleMATHGoogle Scholar
 Desjardins, C.J.: Monomization of Power Ideals and Parking Functions. ProQuest LLC, Ann Arbor, MI (2010). Thesis (Ph.D.)—Massachusetts Institute of TechnologyGoogle Scholar
 Dhar, D.: Selforganized critical state of sandpile automaton models. Phys. Rev. Lett. 64(14), 1613–1616 (1990)MathSciNetView ArticleMATHGoogle Scholar
 Dochtermann, A., Sanyal, R.: Laplacian ideals, arrangements, and resolutions. J. Algebr. Combin. 40(3), 805–822 (2014)MathSciNetView ArticleMATHGoogle Scholar
 Drton, M., Sturmfels, B., Sullivant, S.: Lectures on Algebraic Statistics, Volume 39 of Oberwolfach Seminars. Birkhäuser, Basel (2009)Google Scholar
 Gessel, I.M., Sagan, B.E.: The Tutte polynomial of a graph, depthfirst search, and simplicial complex partitions. Electron. J. Combin. 3(2), Research Paper 9 (1996)Google Scholar
 Gioan, E.: Enumerating degree sequences in digraphs and a cycle–cocycle reversing system. Eur. J. Combin. 28(4), 1351–1366 (2007)MathSciNetView ArticleMATHGoogle Scholar
 Gioan, E.: Circuit–cocircuit reversing systems in regular matroids. Ann. Comb. 12(2), 171–182 (2008)MathSciNetView ArticleMATHGoogle Scholar
 Gioan, E., Las Vergnas, M.: The active bijection in graphs, hyperplane arrangements, and oriented matroids. I. The fully optimal basis of a bounded region. Eur. J. Combin. 30(8), 1868–1886 (2009)MathSciNetView ArticleMATHGoogle Scholar
 Gordon, G., Traldi, L.: Generalized activities and the Tutte polynomial. Discrete Math. 85(2), 167–176 (1990)MathSciNetView ArticleMATHGoogle Scholar
 Gordon, G., Traldi, L.: Polynomials for directed graphs. In: Proceedings of the TwentyFourth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1993), vol. 94, pp. 187–201 (1993)Google Scholar
 Greene, C., Zaslavsky, T.: On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, nonradon partitions, and orientations of graphs. Trans. Am. Math. Soc. 280(1), 97–126 (1983)MathSciNetView ArticleMATHGoogle Scholar
 Holtz, O., Ron, A.: Zonotopal algebra. Adv. Math. 227(2), 847–894 (2011)MathSciNetView ArticleMATHGoogle Scholar
 Hopkins, S.: Another proof of Wilmes’ conjecture. Discrete Math. 323, 43–48 (2014)MathSciNetView ArticleMATHGoogle Scholar
 Hopkins, S., Perkinson, D.: Bigraphical arrangements. Trans. Am. Math. Soc. 368(1), 709–725 (2016)MathSciNetView ArticleMATHGoogle Scholar
 Huang, B.: Monomization of power ideals and generalized parking functions. Preprint, http://math.mit.edu/research/highschool/primes/materials/2014/Huang.pdf (2015)
 Iriarte, B.: Acyclic orientations and spanning trees. arXiv:1412.8114 (Dec 2014)
 Kateri, M., Mohammadi, F., Sturmfels, B.: A family of quasisymmetry models. J. Algebr. Stat. 6(1), 1–16 (2015)MathSciNetView ArticleMATHGoogle Scholar
 Kook, W., Reiner, V., Stanton, D.: A convolution formula for the Tutte polynomial. J. Combin. Theory Ser. B 76(2), 297–300 (1999)MathSciNetView ArticleMATHGoogle Scholar
 Las Vergnas, M.: Convexity in oriented matroids. J. Combin. Theory Ser. B 29(2), 231–243 (1980)MathSciNetView ArticleMATHGoogle Scholar
 Las Vergnas, M.: The Tutte polynomial of a morphism of matroids. II Activities of orientations. In: Progress in Graph Theory (Proceedings, Waterloo Silver Jubilee Conference 1982), pp. 367–380. Academic Press, New York (1984)Google Scholar
 Las Vergnas, M.: The Tutte polynomial of a morphism of matroids 6. A multifaceted counting formula for hyperplane regions and acyclic orientations. arXiv:1205.5424 (May 2012)
 Las Vergnas, M.: The Tutte polynomial of a morphism of matroids—5. Derivatives as generating functions of Tutte activities. Eur. J. Combin. 34(8), 1390–1405 (2013)MathSciNetView ArticleMATHGoogle Scholar
 Manjunath, M., Schreyer, F.O., Wilmes, J.: Minimal free resolutions of the \(G\)parking function ideal and the toppling ideal. Trans. Am. Math. Soc. 367(4), 2853–2874 (2015)MathSciNetView ArticleMATHGoogle Scholar
 Manjunath, M., Sturmfels, B.: Monomials, binomials and Riemann–Roch. J. Algebr. Combin. 37(4), 737–756 (2013)MathSciNetView ArticleMATHGoogle Scholar
 Mazin, M.: Multigraph hyperplane arrangements and parking functions. arXiv:1501.01225. Forthcoming, Ann. Comb. (Jan 2015)
 Merino, C.: The chip firing game and matroid complexes. In: Discrete Models: Combinatorics, Computation, and Geometry (Paris, 2001), Discrete Math. Theor. Comput. Sci. Proc., AA, pp. 245–255 (electronic). Maison Inform. Math. Discrète (MIMD), Paris (2001)Google Scholar
 Merino, C.: Chip firing and the Tutte polynomial. Ann. Comb. 1(3), 253–259 (1997)MathSciNetMATHGoogle Scholar
 Mikhalkin, G., Zharkov, I.: Tropical curves, their Jacobians and theta functions. In: Curves and Abelian Varieties, Volume 465 of Contemporary Mathematics, pp. 203–230. American Mathematical Society, Providence, RI (2008)Google Scholar
 Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra, Volume 227 of Graduate Texts in Mathematics. Springer, New York (2005)Google Scholar
 Mohammadi, F.: Divisors on graphs, orientations, syzygies, and system reliability. J. Algebr. Combin. 43(2), 465–483 (2016)MathSciNetView ArticleMATHGoogle Scholar
 Mohammadi, F., Shokrieh, F.: Divisors on graphs, connected flags, and syzygies. Int. Math. Res. Not. IMRN 24, 6839–6905 (2014)MathSciNetMATHGoogle Scholar
 Mohammadi, F., Shokrieh, F.: Divisors on graphs, binomial and monomial ideals, and cellular resolutions. Math. Z. 283(1–2), 59–102 (2016)MathSciNetView ArticleMATHGoogle Scholar
 Perkinson, D., Perlman, J., Wilmes, J.: Primer for the algebraic geometry of sandpiles. In: Tropical and NonArchimedean Geometry, Volume 605 of Contemporary Mathematics, pp. 211–256. American Mathematical Society, Providence, RI (2013)Google Scholar
 Postnikov, A., Shapiro, B.: Trees, parking functions, syzygies, and deformations of monomial ideals. Trans. Am. Math. Soc. 356(8), 3109–3142 (2004)MathSciNetView ArticleMATHGoogle Scholar
 Postnikov, A., Shapiro, B., Shapiro, M.: Chern forms on flag manifolds and forests. In: Proceedings of the 10th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC ’98. Fields Institute, Toronto (1998)Google Scholar
 Postnikov, A., Shapiro, B., Shapiro, M.: Algebras of curvature forms on homogeneous manifolds. In: Differential Topology, InfiniteDimensional Lie Algebras, and Applications, Volume 194 of American Mathematical Society Translations: Series 2, pp. 227–235. American Mathematical Society, Providence, RI (1999)Google Scholar
 Schenck, H.K.: Linear systems on a special rational surface. Math. Res. Lett. 11(5–6), 697–713 (2004)MathSciNetView ArticleMATHGoogle Scholar
 Shan, J.J.: A special case of Postnikov–Shapiro conjecture. arXiv:1307.5895 (July 2013)
 Stanley, R.P.: Acyclic orientations of graphs. Discrete Math. 5, 171–178 (1973)MathSciNetView ArticleMATHGoogle Scholar
 Stanley, R.P.: Cohen–Macaulay complexes. In: Higher Combinatorics (Proceedings of NATO Advanced Study Institute, Berlin, 1976), pp. 51–62. NATO Advanced Study Institute Series, Series C: Mathematical and Physical Sciences, 31. Reidel, Dordrecht (1977)Google Scholar
 Stanley, R.P.: Decompositions of rational convex polytopes. Ann. Discrete Math. 6, 333–342 (1980)MathSciNetView ArticleMATHGoogle Scholar
 Stanley, R.P.: An introduction to hyperplane arrangements. In: Geometric Combinatorics, Volume 13 of IAS/Park City Mathematical Series, pp. 389–496. American Mathematical Society, Providence, RI (2007)Google Scholar
 Sturmfels, B.: Gröbner Bases and Convex Polytopes, Volume 8 of University Lecture Series. American Mathematical Society, Providence, RI (1996)Google Scholar
 Tutte, W.T.: A contribution to the theory of chromatic polynomials. Can. J. Math. 6, 80–91 (1954)MathSciNetView ArticleMATHGoogle Scholar
 Welsh, D.J.A., Merino, C.: The Potts model and the Tutte polynomial. J. Math. Phys. 41(3), 1127–1152 (2000)MathSciNetView ArticleMATHGoogle Scholar
 Welsh, D.: The Tutte polynomial. Random Struct. Algorithms 15(3–4), 210–228 (1999)MathSciNetView ArticleMATHGoogle Scholar
 Zaslavsky, T.: Facing up to arrangements: facecount formulas for partitions of space by hyperplanes. Mem. Am. Math. Soc. 1(issue 1, 154), vii+102 (1975)MathSciNetMATHGoogle Scholar
 Zaslavsky, T.: Orientation of signed graphs. Eur. J. Combin. 12(4), 361–375 (1991)MathSciNetView ArticleMATHGoogle Scholar