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

In this paper we consider the generalized anchored configuration spaces on $n$ labeled points on a~graph. These are the spaces of all configurations of $n$ points on a~fixed graph $G$, subject to the condition that at least $q$ vertices in…

We determine the maximum number of edges of an $n$-vertex graph $G$ with the property that none of its $r$-cliques intersects a fixed set $M\subset V(G)$. For $(r-1)|M|\ge n$, the $(r-1)$-partite Turan graph turns out to be the unique…

We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…

We consider closed manifolds that admit a metric locally isometric to a product of symmetric planes. For such manifolds, we prove that the Euler characteristic is an obstruction to the existence of flat structures, confirming an old…

Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser…

A theorem of Grove and Searle directly establishes that positive curvature 2d manifolds M with effective circular symmetry group of dimension 8 or less have positive Euler characteristic X(M): the fixed point set N consists of even…

We establish universality of cutoff for simple random walk on a class of random graphs defined as follows. Given a finite graph $G=(V,E)$ with $|V|$ even we define a random graph $ G^*=(V,E \cup E')$ obtained by picking $E'$ to be the…

For a graph $H$, the {\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$. Let $\delta(H)>0$ and $\Delta(H)$ denote the minimum degree and maximum degree of $H$,…

We establish Bernstein-type theorems for entire constant mean curvature graphs in the three-dimensional light cone $\mathbb{Q}^3_+$ over the horosphere under the assumption that the Gaussian curvature $K$ is bounded below, by showing that…

For a graph representation of a dataset, a straightforward normality measure for a sample can be its graph degree. Considering a weighted graph, degree of a sample is the sum of the corresponding row's values in a similarity matrix. The…

A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the gain function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite…

In this paper we present the Ricci curvature on cell-complexes and show the Gauss-Bonnnet type theorem on graphs and 2-complex that decomposes closed surface. The defferential forms on a cell complex is defined as linear maps on chain…

In this work we address the realizability of a Lyapunov graph labeled with GS singularities, namely regular, cone, Whitney, double crossing and triple crossing singularities, as continuous flow on a singular closed $2$-manifold…

A subset $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total dominating set $D$ is called a total co-independent dominating set if the subgraph induced by…

In this paper, we prove a sharp convergence theorem for the mean curvature flow of arbitrary codimension in spheres which improves Baker's convergence theorem. In particular, we obtain a new differentiable sphere theorem for submanifolds in…

The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…

The translative intersection formula of integral geometry yields an expression for the mean Euler characteristic of a stationary random closed set intersected with a fixed observation window. We formulate this result in the setting of sets…

Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…

This paper develops a harmonic Galois theory for finite graphs, thereby classifying harmonic branched $G$-covers of a fixed base $X$ in terms of homomorphisms from a suitable fundamental group of $X$ together with $G$-inertia structures on…

Based on a calibration argument, we prove a Bernstein type theorem for entire minimal graphs over Gauss space $\mathbb{G}^n$ by a simple proof.