Related papers: A graph theoretical Gauss-Bonnet-Chern Theorem

We discuss the universal orbifold Euler characteristic and generalized orbifold Euler characteristics corresponding to finitely generated groups $A$ (the $A$-Euler characteristics). We show that the collection of all $A$-Euler…

An \emph{$(n,k,t)$-graph} is a graph on $n$ vertices in which every set of $k$ vertices contains a clique on $t$ vertices. Tur\'an's Theorem, rephrased in terms of graph complements, states that the unique minimum $(n,k,2)$-graph is an…

In this paper, I construct noncompact analogs of the Chern classes of equivariant vector bundles over complex reductive groups. For the tangent bundle, these Chern classes yield an adjunction formula for the Euler characteristic of complete…

We obtain a necessary condition for the character degree graph of a solvable group G to be Eulerian.

In this paper, we prove the following two results: First, we study a class of conformally invariant operators $P$ and their related conformally invariant curvatures $Q$ on even-dimensional Riemannian manifolds. When the manifold is locally…

Given a graph G=(V, E), a vertex is said to ve-dominate an edge if it is either incident with the edge or adjacent to one of its endpoints. A set of vertices is a ve-dominating set if it ve-dominates every edge of the graph. We introduce…

In this short note we outline a simple probabilistic proof of the Gauss-Bonnet formula for compact Riemannian manifolds with boundary, which adapts to this setting an argument due to Hsu \cite{Hs1,Hs2} in the closed case. The new technical…

A finite simple graph G is declared to have positive curvature if every in G embedded wheel graph has five or six vertices. A d-graph is a finite simple graph G for which every unit sphere is a (d-1)-sphere. A d-sphere is a d-graph G for…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

We show that if the curvature of a Cartan-Hadamard $n$-manifold is constant near a convex hypersurface $\Gamma$, then the total Gauss-Kronecker curvature $\mathcal{G}(\Gamma)$ is not less than that of any convex hypersurface nested inside…

For a graph $G$ let $\varepsilon(G)$ denote the number of Eulerian orientations, and $v(G)$ denote the number of vertices of $G$. We show that if $(G_n)_n$ is a sequence of Eulerian graphs that are convergent in Benjamini--Schramm sense,…

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

We prove an analog of the Gauss-Bonnet formula for constructible sheaves on reductive groups. As a corollary from this formula we get that if a perverse sheaf on a reductive group is equivariant under the adjoint action, then its Euler…

We study the enumeration of graph orientations under local degree constraints. Given a finite graph $G = (V, E)$ and a family of admissible sets $\{\mathsf P_v \subseteq \mathbb{Z} : v \in V\}$, let $\mathcal N (G; \prod_{v \in V} \mathsf…

We study the Bakry-\'Emery curvature function $\mathcal{K}_{G,x}:(0,\infty]\to \mathbb{R}$ of a vertex $x$ in a locally finite graph $G$ systematically. Here $\mathcal{K}_{G,x}(\mathcal{N})$ is defined as the optimal curvature lower bound…

Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

In this paper we obtain some explicit expressions for the Euler characteristic of a rank n coherent sheaf F on P^N and of its twists F(t) as polynomials in the Chern classes c_i(F), also giving algorithms for the computation. The employed…

We analyze the universality and generalization of graph neural networks (GNNs) on attributed graphs, i.e., with node attributes. To this end, we propose pseudometrics over the space of all attributed graphs that describe the fine-grained…

Let H = (V,E) be a k-uniform hypergraph with a vertex set V and an edge set E. Let V_p be constructed by taking every vertex in V independently with probability p. Let X be the number of edges in E that are contained in V_p. We give a…