Related papers: Eulerian 2-Complexes
Algebraic curves have a discrete analogue in finite graphs. Pursuing this analogy we prove a Torelli theorem for graphs. Namely, we show that two graphs have the same Albanese torus if and only if the graphs obtained from them by…
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,…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
Leighton's graph covering theorem states that two finite graphs with common universal cover have a common finite cover. We generalize this to a large family of non-positively curved special cube complexes that form a natural generalization…
Given a cooriented branched surface $\mathcal B$ fully carrying a foliation $\mathcal F$, we use the dual graph of $\mathcal B$ to define a simplicial 1-cycle $\Gamma_m(\mathcal B)$ representing the Poincar\'e dual of the Euler class of…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees. The case when $G$ is complete confirms a conjecture of Chung, Diaconis and Graham from 1989…
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and…
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…
We propose a Law of Nature? Viz., Pure Regularity Occurs at Na\"ive Levels and Regularity has Affinity with Evenness. In a series of three papers, it was established that regular Euler graphs with only one type of (pure) cycles are…
Haj\'os' conjecture states that an Eulerian graph of order n can be decomposed into at most (n-1)/2 edge-disjoint cycles. We describe preprocessing steps, heuristics and integer programming techniques that enable us to verify Haj\'os'…
An Euler tour in a hypergraph $H$ is a closed walk that traverses each edge of $H$ exactly once, and an Euler family is a family of closed walks that jointly traverse each edge of $H$ exactly once. An $\ell$-covering $k$-hypergraph, for $2…
Applying geometric methods of $2$-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite…
We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…
We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gutman, Cruz, Rada, Wiener index of Eulerian Graphs, Discrete…
Given two finite covers $p: X \to S$ and $q: Y \to S$ of a connected, oriented, closed surface $S$ of genus at least $2$, we attempt to characterize the equivalence of $p$ and $q$ in terms of which curves lift to simple curves. Using…
The Eulerian idempotents, first introduced for the symmetric group and later extended to all reflection groups, generate a family of representations called the Eulerian representations that decompose the regular representation. In Type $A$,…
We show that the graph transformation problem of turning a simple graph into an Eulerian one by a minimum number of single edge switches is NP-hard. Further, we show that any simple Eulerian graph can be transformed into any other such…
We present an equivalent criterion for the global existence of Euler's multiplier for an integrable one-form taking into account the corresponding codim-1-foliation. In particular, the impact of inseparable leaves is considered. Here, we…