Related papers: Hyperelliptic graphs and metrized complexes

We draw comparisons between the author's recent construction of limit linear series for curves not of compact type and the Amini-Baker theory of limit linear series on metrized complexes, as well as the related theories of divisors on…

We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…

The aim of this paper is to apply the framework, which was developed by Sam and Snowden, to study structural properties of graph homologies, in the spirit of Ramos, Miyata and Proudfoot. Our main results concern the magnitude homology of…

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected…

In this (mostly) survey article, we give a synopsis of a number of results relating to Brill--Noether theory on curves and metric graphs, together with some speculations about the behavior of one-dimensional linear series on a class of…

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

Let $G$ be an $r$-uniform hypergraph on $n$ vertices such that all but at most $\varepsilon \binom{n}{\ell}$ $\ell$-subsets of vertices have degree at least $p \binom{n-\ell}{r-\ell}$. We show that $G$ contains a large subgraph with high…

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

We investigate a canonical extension of a conventional combinatorial notion of reduced divisors to a notion of tropical projections, which can be defined as the unique minimizers of the so-called $B$-pseudonorms with respect to compact…

Let $G$ be a finite group, $N$ a normal subgroup of $G$, and $k$ a field of characteristic $p>0$. In this paper, we formulate the brick version of Clifford's theorem under suitable assumptions and prove it by using the theory of wide…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

Clifford indices of vector bundles on algebraic curves were introduced in a previous paper of the authors. In this paper we study bundles of rank 2 which compute these Clifford indices. This is of particular interest in the light of…

We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. We show that equality holds for grid graphs and complete multipartite graphs. We prove that the treewidth lower bound also holds for…

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…

We extend Campion's pasting theorem for $(\infty, n)$-categories to a larger class of polygraphs, called the directed complexes with frame-acyclic molecules. It follows, for instance, that this pasting theorem applies to any polygraph…

We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…