Related papers: Surface topology and incidence theorems over divis…
Let T -> S be a finite flat morphism of degree two between regular integral schemes of dimension at most two (and with 2 invertible), having regular branch divisor D. We establish a bijection between Azumaya quaternion algebras on T and…
The embedding theorem of Roelcke and Dierolf for the completions of four standard uniform structures on topological groups and their quotients holds more generally for spaces of uniform measures. The natural mappings between the four spaces…
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…
The theory of persistence modules is an emerging field of algebraic topology which originated in topological data analysis. In these notes we provide a concise introduction into this field and give an account on some of its interactions…
This is a companion paper to the paper "Hyperstability in the Erdos-Sos Conjecture". In that paper the following rough structure theorem was proved for graphs G containing no copy of a bounded degree tree T: from any such G, one can delete…
The divergence theorem in its usual form applies only to suitably smooth vector fields. For vector fields which are merely piecewise smooth, as is natural at a boundary between regions with different physical properties, one must patch…
The notion of graph cover, also known as locally bijective homomorphism, is a discretization of covering spaces known from general topology. It is a pair of incidence-preserving vertex- and edge-mappings between two graphs, the…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
In the tangent plane at any point of a surface in the four-dimensional Euclidean space we consider an invariant linear map of Weingarten-type and find a geometrically determined moving frame field. Writing derivative formulas of Frenet-type…
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
One of the most elusive challenges within the area of topological data analysis is understanding the distribution of persistence diagrams. Despite much effort, this is still largely an open problem. In this paper, we present a series of…
A generic surface in Euclidean 3-space is determined uniquely by its metric and curvature. Classification of all special surfaces where this is not the case, i.e. of surfaces possessing isometries which preserve the mean curvature, is known…
In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…
We present an easy structure theorem for graphs which do not admit an immersion of the complete graph. The theorem motivates the definition of a variation of tree decompositions based on edge cuts instead of vertex cuts which we call…
We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.
This study delves into the incidence matrices of hypergraphs, with a focus on two types: the edge-vertex incidence matrix and the vertex-edge incidence matrix. The edge-vertex incidence matrix is a matrix in which the rows represent…
A configuration of the triple $(\mathcal{P}, \mathcal{L}, \mathcal{I})$ on the incidence relation which holds the properties of "Any two points are incident with at most one line" and "Any two lines are incident with at most one point". In…
A spreading process on a network is influenced by the network's underlying spatial structure, and it is insightful to study the extent to which a spreading process follows such structure. We consider a threshold contagion model on a network…
Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering…
We introduce pathographs as a framework to study graph classes defined by forbidden structures, including forbidding induced subgraphs, minors, etc. Pathographs approximately generalize s-graphs of L\'ev\^eque--Lin--Maffray--Trotignon by…