Related papers: Twice-Marked Banana Graphs & Brill-Noether General…

In earlier papers, we showed a decomposition of 2-diregular digraphs (2-dds) and used it to provide some sufficient conditions for these graphs to be non-Hamiltonian; we also showed a close connection between the permanent and determinant…

We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…

To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…

The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…

We study Poincar\'e series associated to a finite collection of divisors on i. a finite graph and ii. a certain family of metric graphs called chain of loops. Our main results are proofs of rationality of the Poincar\'e series and…

We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any $n$-vertex, $d$-regular graph $G$ and any graph $H$ (possibly with loops), \[\hom(G,H) \leq \max\left\lbrace\hom(K_{d,d}, H)^{\frac{n}{2d}},…

Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…

For finite sequence $\underbar{\em d}$ of positive integers, we consider graphs that have $\underbar{\em d}$ as their list of vertex degrees, and bipartite graphs for which each part has $\underbar{\em d}$ as its list of vertex degrees. In…

Understanding when an abstract complex curve of given genus comes equipped with a map of fixed degree to a projective space of fixed dimension is a foundational question; and Brill--Noether theory addresses this question via linear series,…

As an application of Szemeredi's regularity lemma, Erdos-Frankl-Rodl (1986) showed that the number of graphs on vertex set {1,2,...n} with a monotone class P is $2^{(1+o(1))ex(n,P)n^2/2}$ where $ex(n,P)$ is the maximum number of edges of an…

Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…

We investigate the Brill-Noether theory of rank-two, degree-$d$ stable vector bundles of speciality $3$ on a general $\nu$-gonal curve of genus $g$, $3 \leq \nu < \lfloor \frac{g+3}{2} \rfloor$. Our approach leverages universal extension…

In this paper, we introduce the t-graphs defined on finitely-generate groups. We study some general aspects of the t-graphs on 2-generator groups, emphasising establishing necessary conditions for their connectedness. In particular, we…

We survey basic results concerning Prym varieties, the Prym-Brill-Noether theory initiated by Welters, and Brill-Noether theory of general \'etale double covers of curves of genus g>=2. We then specialize to curves on Nikulin surfaces and…

In this paper, we describe the Brill--Noether theory of a general smooth plane curve and a general curve $C$ on a Hirzebruch surface of fixed class. It is natural to study the line bundles on such curves according to the splitting type of…

In this paper, we extend Ocneanu's theory of connections on graphs to define a 2-category whose 0-cells are tracial Bratteli diagrams, and whose 1-cells are generalizations of unitary connections. We show that this 2-category admits an…

In 1965, Erd\H{o}s and P\'{o}sa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Such a duality does not hold for odd cycles, and Dejter…

In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…