Related papers: A graph theoretical Gauss-Bonnet-Chern Theorem
A graph $G$ is $(d_1,\ldots,d_k)$-colorable if its vertex set can be partitioned into $k$ sets $V_1,\ldots,V_k$, such that for each $i\in\{1, \ldots, k\}$, the subgraph of $G$ induced by $V_i$ has maximum degree at most $d_i$. The Four…
We prove Chern conjecture, which states that the Euler characteristic vanishes for closed flat affine manifolds. Our key innovation is a deformation argument for the Euler form.
Graph generative model evaluation necessitates understanding differences between graphs on the distributional level. This entails being able to harness salient attributes of graphs in an efficient manner. Curvature constitutes one such…
We offer an alternative proof, using the Stein-Chen method, of Bollob\'{a}s' theorem concerning the distribution of the extreme degrees of a random graph. Our proof also provides a rate of convergence of the extreme degree to its asymptotic…
We show that a general curve in an explicit class of what we call Du Val pointed curves satisfies the Brill-Noether Theorem for pointed curves. Furthermore, we prove that a generic pencil of Du Val pointed curves is disjoint from all…
We determine the expected curvature polynomial of random real projective varieties given as the zero set of independent random polynomials with Gaussian distribution, whose distribution is invariant under the action of the orthogonal group.…
In this paper, we study the mean curvature flow of graphs with Neumann boundary condition. The main aim is to use the maximum principle to get the boundary gradient estimate for solutions. In particular, we obtain the corresponding…
We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.
In [5], S\'aez and Schn\"urer studied the graphical mean curvature flow of complete hypersurfaces defined on subsets of Euclidean space. They obtained long time existence. Moreover, they provided a new interpretation of weak mean curvature…
Interest has been rising lately towards methods representing data in non-Euclidean spaces, e.g. hyperbolic or spherical, that provide specific inductive biases useful for certain real-world data properties, e.g. scale-free, hierarchical or…
Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…
The edge-Wiener index of a connected graph $G$ is defined as the Wiener index of the line graph of $G$. In this paper it is shown that the edge-Wiener index of an edge-weighted graph can be computed in terms of the Wiener index, the…
The statement of the Gauss-Bonnet theorem brings up an unexpected form of reflexivity (major concept of philosophy of mathematics), so that geometry contemplates itself in it. It is therefore the revolutionary and multifaceted concept of…
The purpose of this paper is to show that for a complete intersection curve $C$ in projective space (other than a few stated exceptions), any morphism $f: C \to \mathbb{P}^r$ satisfying $\text{deg}\, f^*\mathcal{O}_{\mathbb{P}^r}(1)…
A quandle is an algebraic system whose axioms generalize the algebraic structure of the point symmetries of symmetric spaces. In this paper, we give a definition of Euler characteristics for quandles. In particular, the quandle Euler…
In this paper we combine methods from additive combinatorics and Diophantine geometry to study the generalised sum-product phenomenon in algebraic groups. As an application of this circle of ideas, we resolve a conjecture of Bremner on…
The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…
We use a Riemannnian approximation scheme to define a notion of $\textit{sub-Riemannian Gaussian curvature}$ for a Euclidean $C^{2}$-smooth surface in the Heisenberg group $\mathbb{H}$ away from characteristic points, and a notion of…