Related papers: Eulerian 2-Complexes
In the present paper we generalize the Eulerian numbers (also of the second and third orders). The generalization is connected with an autonomous first-order differential equation, solutions of which are used to obtain integral…
We demonstrate that when a graph exhibits a specific type of symmetry, it satisfies the Union Closed Conjecture(UCC). Additionally, we show that certain graph classes, such as Cylindrical Grid Graphs and Torus Grid Graphs also satisfy the…
We prove a number of new restrictions on the enumerative properties of homology manifolds and semi-Eulerian complexes and posets. These include a determination of the affine span of the fine $h$-vector of balanced semi-Eulerian complexes…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
This paper, along with E592 and E636, seems to consider the binomial expansion (1+z)^n in the case where z is complex. Euler even gives the sums of divergent series. The paper is translated from Euler's Latin original into German.
We study type one generalized complex and generalized Calabi--Yau manifolds. We introduce a cohomology class that obstructs the existence of a globally defined, closed 2-form which agrees with the symplectic form on the leaves of the…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…
Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…
We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…
We define the Eulerian ideal of a $k$-uniform hypergraph and study its degree and Castelnuovo--Mumford regularity. The main tool is a Gr\"obner basis of the ideal obtained combinatorially from the hypergraph. We define the notion of parity…
We construct new resolvable decompositions of complete multigraphs and complete equipartite multigraphs into cycles of variable lengths (and a perfect matching if the vertex degrees are odd). We develop two techniques: {\em layering}, which…
For conic bundles on a smooth variety (over a field of characteristic $\ne 2$) which degenerate into pairs of distinct lines over geometric points of a smooth divisor, we prove a theorem which relates the Brauer class of the non-degenerate…
We prove several claims made by Kontsevich about the orbifold Euler characteristic of the three types of graph homology introduced by him. For this purpose, first we develop a simplified version of the Feynman diagram method, which requires…
We develop a theory of group actions and coverings on Brauer graphs that parallels the theory of group actions and coverings of algebras. In particular, we show that any Brauer graph can be covered by a tower of coverings of Brauer graphs…
The topological Tverberg theorem states that any continuous map of a $(d+1)(r-1)$-simplex into the Euclidean $d$-space maps some points from $r$ pairwise disjoint faces of the simplex to the same point whenever $r$ is a prime power. We…
In Part I of our study on 2D Euler equation, we established the spectral theorem for a linearized 2D Euler equation. We also computed the point spectrum through continued fractions, and identified the eigenvalues with nonzero real parts. In…
In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number…
We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…