Number Of Eulerian Orientations Research Articles

Covers, Orientations and Factors

Given a graph $G$ with only even degrees, let $\varepsilon(G)$ denote the number of Eulerian orientations, and let $h(G)$ denote the number of half graphs, that is, subgraphs $F$ such that $d_F(v)=d_G(v)/2$ for each vertex $v$. Recently, Borbényi and Csikvári proved that $\varepsilon(G)\geq h(G)$ holds true for all Eulerian graphs, with equality if and only if $G$ is bipartite. In this paper we give a simple new proof of this fact, and we give identities and inequalities for the number of Eulerian orientations and half graphs of a $2$-cover of a graph $G$.

Bounds on the number of Eulerian orientations

We show that each loopless 2k-regular undirected graph onn vertices has at least\(\left( {2^{ - k} \left( {_k^{2k} } \right)} \right)^n \) and at most\(\sqrt {\left( {_k^{2k} } \right)^n } \) eulerian orientations, and that, for each fixedk, these ground numbers are best possible.