Eulerian matroid

In matroid theory, an Eulerian matroid is a matroid whose elements can be partitioned into a collection of disjoint circuits.

Examples

In a uniform matroid ${\displaystyle U{}_{n}^{r}}$, the circuits are the sets of exactly ${\displaystyle r+1}$ elements. Therefore, a uniform matroid is Eulerian if and only if ${\displaystyle r+1}$ is a divisor of ${\displaystyle n}$. For instance, the ${\displaystyle n}$-point lines ${\displaystyle U{}_{n}^{2}}$ are Eulerian if and only if ${\displaystyle n}$ is divisible by three.

The Fano plane has two kinds of circuits: sets of three collinear points, and sets of four points that do not contain any line. The three-point circuits are the complements of the four-point circuits, so it is possible to partition the seven points of the plane into two circuits, one of each kind. Thus, the Fano plane is also Eulerian.

Relation to Eulerian graphs

Eulerian matroids were defined by Welsh (1969) as a generalization of the Eulerian graphs, graphs in which every vertex has even degree. By Veblen's theorem the edges of every such graph may be partitioned into simple cycles, from which it follows that the graphic matroids of Eulerian graphs are examples of Eulerian matroids. ^[1]

The definition of an Eulerian graph above allows graphs that are disconnected, so not every such graph has an Euler tour. Wilde (1975) observes that the graphs that have Euler tours can be characterized in an alternative way that generalizes to matroids: a graph ${\displaystyle G}$ has an Euler tour if and only if it can be formed from some other graph ${\displaystyle H}$, and a cycle ${\displaystyle C}$ in ${\displaystyle H}$, by contracting the edges of ${\displaystyle H}$ that do not belong to ${\displaystyle C}$. In the contracted graph, ${\displaystyle C}$ generally stops being a simple cycle and becomes instead an Euler tour. Analogously, Wilde considers the matroids that can be formed from a larger matroid by contracting the elements that do not belong to some particular circuit. He shows that this property is trivial for general matroids (it implies only that each element belongs to at least one circuit) but can be used to characterize the Eulerian matroids among the binary matroids, matroids representable over GF(2): a binary matroid is Eulerian if and only if it is the contraction of another binary matroid onto a circuit. ^[2]

Duality with bipartite matroids

For planar graphs, the properties of being Eulerian and bipartite are dual: a planar graph is Eulerian if and only if its dual graph is bipartite. As Welsh showed, this duality extends to binary matroids: a binary matroid is Eulerian if and only if its dual matroid is a bipartite matroid, a matroid in which every circuit has even cardinality. ^{[1] [3]}

For matroids that are not binary, the duality between Eulerian and bipartite matroids may break down. For instance, the uniform matroid ${\displaystyle U{}_{6}^{2}}$ is Eulerian but its dual ${\displaystyle U{}_{6}^{4}}$ is not bipartite, as its circuits have size five. The self-dual uniform matroid ${\displaystyle U{}_{6}^{3}}$ is bipartite but not Eulerian.

Alternative characterizations

Because of the correspondence between Eulerian and bipartite matroids among the binary matroids, the binary matroids that are Eulerian may be characterized in alternative ways. The characterization of Wilde (1975) is one example; two more are that a binary matroid is Eulerian if and only if every element belongs to an odd number of circuits, if and only if the whole matroid has an odd number of partitions into circuits. ^[4] Lovász & Seress (1993) collect several additional characterizations of Eulerian binary matroids, from which they derive a polynomial time algorithm for testing whether a binary matroid is Eulerian. ^[5]

Computational complexity

Any algorithm that tests whether a given matroid is Eulerian, given access to the matroid via an independence oracle, must perform an exponential number of oracle queries, and therefore cannot take polynomial time. In particular, it is difficult to distinguish a uniform matroid on a set of ${\displaystyle 2n}$ elements, with all cycles of size ${\displaystyle n+1}$, from a paving matroid that differs from the uniform matroid in having two complementary cycles of size ${\displaystyle n}$. The paving matroid is Eulerian but the uniform matroid is not. Any oracle algorithm, applied to the uniform matroid, must make ${\displaystyle {\tbinom {2n}{n}}/2}$ queries, an exponential number, to verify that the input is not instead an instance of the paving matroid. ^[6]

Eulerian extension

If ${\displaystyle M}$ is a binary matroid that is not Eulerian, then it has a unique Eulerian extension, a binary matroid ${\displaystyle {\bar {M}}}$ whose elements are the elements of ${\displaystyle M}$ together with one additional element ${\displaystyle e}$, such that the restriction of ${\displaystyle {\bar {M}}}$ to the elements of ${\displaystyle M}$ is isomorphic to ${\displaystyle M}$. The dual of ${\displaystyle {\bar {M}}}$ is a bipartite matroid formed from the dual of ${\displaystyle M}$ by adding ${\displaystyle e}$ to every odd circuit. ^[7]

References

1. Welsh, D. J. A. (1969), "Euler and bipartite matroids", Journal of Combinatorial Theory , 6: 375–377, doi: 10.1016/s0021-9800(69)80033-5 , MR   0237368 .
2. Wilde, P. J. (1975), "The Euler circuit theorem for binary matroids", Journal of Combinatorial Theory , Series B, 18: 260–264, doi: 10.1016/0095-8956(75)90051-9 , MR   0384577 .
3. Harary, Frank; Welsh, Dominic (1969), "Matroids versus graphs", The Many Facets of Graph Theory (Proc. Conf., Western Mich. Univ., Kalamazoo, Mich., 1968), Lecture Notes in Mathematics, vol. 110, Berlin: Springer, pp. 155–170, doi:10.1007/BFb0060114, MR   0263666 .
4. Shikare, M. M. (2001), "New characterizations of Eulerian and bipartite binary matroids" (PDF), Indian Journal of Pure and Applied Mathematics, 32 (2): 215–219, MR   1820861, archived from the original (PDF) on 2015-07-06, retrieved 2012-08-28.
5. Lovász, László; Seress, Ákos (1993), "The cocycle lattice of binary matroids", European Journal of Combinatorics, 14 (3): 241–250, doi: 10.1006/eujc.1993.1027 , MR   1215334 .
6. Jensen, Per M.; Korte, Bernhard (1982), "Complexity of matroid property algorithms", SIAM Journal on Computing , 11 (1): 184–190, doi:10.1137/0211014, MR   0646772 .
7. Sebő, András (1990), "The cographic multiflow problem: an epilogue", Polyhedral combinatorics (Morristown, NJ, 1989), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 1, Providence, RI: Amer. Math. Soc., pp. 203–234, MR   1105128 .