Related papers: Twice-Marked Banana Graphs & Brill-Noether General…
A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…
We construct a space classifying divisor classes of a fixed degree on all tropical curves of a fixed combinatorial type and show that the function taking a divisor class to its rank is upper semicontinuous. We extend the definition of the…
Twin-width is a newly introduced graph width parameter that aims at generalizing a wide range of "nicely structured" graph classes. In this work, we focus on obtaining good bounds on twin-width $\text{tww}(G)$ for graphs $G$ from a number…
The celebrated Erd\H{o}s-P\'{o}sa Theorem, in one formulation, asserts that for every $c\geq 1$, graphs with no subgraph (or equivalently, minor) isomorphic to the disjoint union of $c$ cycles have bounded treewidth. What can we say about…
A non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. The toughness $\tau(G)$ of the graph $G$ is the maximum value of $t$ such that $G$…
Given a graph $G$ and a subset $X$ of vertices of $G$ with size at least two, we denote by $N^2_G(X)$ the set of vertices of $G$ that have at least two neighbors in $X$. We say that a bipartite graph $G$ with sides $A$ and $B$ satisfies the…
Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht-Fraisse bijective pebble game in Hella's (Ann. Pure Appl. Log., 1989) hierarchy. This is a Spoiler-Duplicator game…
Recently, several works by a number of authors have provided characterizations of integral undirected Cayley graphs over generalized dihedral groups and generalized dicyclic groups. We generalize and unify these results in two different…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
A refined Brill--Noether theory seeks to determine which linear series are admitted by a ``general'' curve in a particular Brill--Noether locus. However, as Brill--Noether loci are not irreducible in general, a coarse answer is given by the…
Diestel and Leader have characterised connected graphs that admit a normal spanning tree via two classes of forbidden minors. One class are Halin's $(\aleph_0,\aleph_1)$-graphs: bipartite graphs with bipartition $(\mathbb{N},B)$ such that…
Our purpose in this paper is to construct new examples of twisted Brill-Noether loci on curves of genus $g\ge2$. Many of these examples have negative expected dimension. We deduce also the existence of a new region in the Brill-Noether map,…
We present a generalization of the Dehornoy-Brin braided Thompson group $BV_2$ that uses recursive braids. Our new groups are denoted by $BV_{n,r}(H)$, for all $n\geq 2,r\geq 1$ and $H \leq \mathcal{B}_n$, where $\mathcal{B}_n$ is the braid…
Two-sided group digraphs and graphs, introduced by Iradmusa and Praeger, provide a generalization of Cayley digraphs and graphs in which arcs are determined by left and right multiplying by elements of two subsets of the group. We…
Stacks of D3-branes placed at the tip of a cone over a del Pezzo surface provide a way of geometrically engineering a small but rich class of gauge/gravity dualities. We develop tools for understanding the resulting quiver gauge theories…
We construct families of cell complexes that generalize expander graphs. These families are called non-$k$-hyperfinite, generalizing the idea of a non-hyperfinite (NH) family of graphs. Roughly speaking, such a complex has the property that…
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…