相关论文: Combinatorial modulus and type of graphs

Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a triangulation, we determine necessary and sufficient…

We show that every triangulation (maximal planar graph) on $n\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity…

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…

We provide a combinatorial model for spin surfaces. Given a triangulation of an oriented surface, a spin structure is encoded by assigning to each triangle a preferred edge, and to each edge an orientation and a sign, subject to certain…

The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modification problem centered around transforming a given graph into…

We introduce the notion of an \emph{asymptotic triangulation} of the annulus. We show that asymptotic triangulations can be mutated as the usual triangulations and describe their exchange graph. Viewing asymptotic triangulations as limits…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…

Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without…

We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…

The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…

To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…

This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…

Given a contraction of a variety X to a base Y, we enhance the locus in Y over which the contraction is not an isomorphism with a certain sheaf of noncommutative rings D, under mild assumptions which hold in the case of (1) crepant partial…

We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…

We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…

This work is the extension of the results by the author in [7] and [6] for low-genus surfaces. Let $S$ be an orientable, connected surface of finite topological type, with genus $g \leq 2$, empty boundary, and complexity at least $2$; as a…

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

How to obtain a graph from data samples is an important problem in graph signal processing. One way to formulate this graph learning problem is based on Gaussian maximum likelihood estimation, possibly under particular topology constraints.…