Related papers: Divisors on graphs, binomial and monomial ideals, …
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…
We construct cellular resolutions for monomial ideals via discrete Morse theory. In particular, we develop an algorithm to create homogeneous acyclic matchings and we call the cellular resolutions induced from these matchings Barile-Macchia…
We study rational normal curves via a connection to the chip firing game. A key technique, introduced in this article, is to interpret the defining ideal of the rational normal curve as an ideal associated to a generalisation of a cycle…
We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of…
In this paper, we characterize chordal and perfect zero-divisor graphs of finite posets. Also, it is proved that the zero-divisor graphs of finite posets and the complement of zero-divisor graphs of finite $0$-distributive posets satisfy…
In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…
We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…
The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such…
The divisor theory of the complete graph $K_n$ is in many ways similar to that of a plane curve of degree $n$. We compute the splitting types of all divisors on the complete graph $K_n$. We see that the possible splitting types of divisors…
Motivated by using combinatorics to study jets of monomial ideals, we extend a definition of jets from graphs to clutters. We offer some structural results on their vertex covers, and show an interesting connection between the cover ideal…
We consider the fair allocation of indivisible items to several agents and add a graph theoretical perspective to this classical problem. Namely, we introduce an incompatibility relation between pairs of items described in terms of a…
The aim of this thesis is to investigate the Betti diagrams of squarefree monomial ideals in polynomial rings. We use two key tools to help us study these diagrams. The first is the Stanley-Reisner Correspondence, which assigns a unique…
We study Dressians of matroids using the initial matroids of Dress and Wenzel. These correspond to cells in regular matroid subdivisions of matroid polytopes. An efficient algorithm for computing Dressians is presented, and its…
The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…