English
Related papers

Related papers: Refined Brill-Noether Theory for Complete Graphs

200 papers

For graphs $G$ and $H$, let $G\to (H,H)$ signify that any red/blue edge coloring of $G$ contains a monochromatic $H$ as a subgraph, and $\mathcal{H}(\Delta,n)=\{H:|V(H)|=n,\Delta(H)\le \Delta\}$. For fixed $\Delta$ and $n$, we say that $G$…

Combinatorics · Mathematics 2015-08-10 Qizhong Lin , Yusheng Li

We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…

Algebraic Topology · Mathematics 2015-07-06 Amrita Acharyya , Jon M. Corson , Bikash Das

We briefly survey recent results related to linear series on curves that are general in various moduli spaces, highlighting the interplay between algebraic geometry on a general curve and the combinatorics of its degenerations.…

Algebraic Geometry · Mathematics 2021-11-02 David Jensen , Sam Payne

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after the removal of a given finite set of edges. We prove that…

Logic · Mathematics 2026-02-11 Nicanor Carrasco-Vargas , Valentino Delle Rose , Cristóbal Rojas

A graph $G$ is a {\em chordal-$k$-generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G[V \setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split graphs are…

Discrete Mathematics · Computer Science 2017-04-28 Andreas Brandstädt , Raffaele Mosca

We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify…

Commutative Algebra · Mathematics 2009-08-17 Sandra Spiroff , Cameron Wickham

We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to…

Discrete Mathematics · Computer Science 2014-04-25 M. Drew LaMar

We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to both classical problems, such as partitioning into…

Combinatorics · Mathematics 2025-11-26 Lajos Győrffy , András London , Gábor V. Nagy , András Pluhár

We define a divisor theory for graphs and tropical curves endowed with a weight function on the vertices; we prove that the Riemann-Roch theorem holds in both cases. We extend Baker's Specialization Lemma to weighted graphs.

Combinatorics · Mathematics 2013-03-07 Omid Amini , Lucia Caporaso

As in our previous work [1] we address the problem to determine the splitting of the normal bundle of rational curves. With apolarity theory we are able to characterize some particular subvarieties in some Hilbert scheme of rational curves,…

Algebraic Geometry · Mathematics 2012-03-23 Alessandro Bernardi

We consider coverings of real algebraic curves to real rational algebraic curves. We show the existence of such coverings having prescribed topological degree on the real locus. From those existence results we prove some results on…

Algebraic Geometry · Mathematics 2011-07-26 Marc Coppens , Johannes Huisman

A Laurent polynomial $f$ in two variables naturally describes a projective curve $C(f)$ on a toric surface. We show that if $C(f)$ is a smooth curve of genus at least 7, then $C(f)$ is not Brill-Noether general. To accomplish this, we…

Algebraic Geometry · Mathematics 2014-04-01 Geoffrey Degener Smith

Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \emph{partition modulus of $G$},…

Combinatorics · Mathematics 2014-08-05 Peter J. Cameron , Sebastian M. Cioabă

We analyze a family of graphs known as banana graphs, with two marked vertices, through the lens of Hurwitz-Brill-Noether theory. As an application, we construct explicit new examples of finite graphs which are Brill-Noether general. These…

Combinatorics · Mathematics 2022-12-01 Nathan Pflueger , Noah Solomon

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

Combinatorics · Mathematics 2019-03-19 Jeffrey Beyerl , Cameron Sharpe

This article classifies Knutsen K3 surfaces all of whose hyperplane sections are irreducible and reduced. As an application, this gives infinite families of K3 surfaces of Picard number two whose general hyperplane sections are…

Algebraic Geometry · Mathematics 2012-08-27 Maxim Arap , Nicholas Marshburn

We associate a sequence of positive integers, termed the type sequence, with a cochordal graph. Using this type sequence, we compute all graded Betti numbers of its edge ideal. We then classify all positive integer $n$ such that the zero…

Commutative Algebra · Mathematics 2024-11-13 Le Xuan Dung , Thanh Vu

A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for…

Combinatorics · Mathematics 2024-11-20 Enrique Gomez-Leos , Ryan R. Martin

Severi varieties and Brill-Noether theory of curves on K3 surfaces are well understood. Yet, quite little is known for curves on abelian surfaces. Given a general abelian surface $S$ with polarization $L$ of type $(1,n)$, we prove…

Algebraic Geometry · Mathematics 2015-03-25 Andreas Leopold Knutsen , Margherita Lelli-Chiesa , Giovanni Mongardi

This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive factors. A factorisation of a complete graph $K_n$ is a partition of its edges into disjoint classes. Each class of edges in a…

Combinatorics · Mathematics 2007-05-23 Tian Khoon Lim