Related papers: Stable curves and chromatic polynomials

Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…

An $(m, n)$-colored mixed graph is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism of an $(m, n$)-colored mixed graph $G$ to an $(m, n)$-colored mixed graph $H$ is a vertex mapping such…

We explain how to compute top-dimensional intersections of psi-classes on moduli spaces of m-stable curves. On the moduli spaces of Deligne-Mumford stable pointed curves of genus one, these intersection numbers are determined by two…

The chromatic polynomial of a graph G counts the number of proper colorings of G. We give an affirmative answer to the conjecture of Read and Rota-Heron-Welsh that the absolute values of the coefficients of the chromatic polynomial form a…

Given a graph G (or more generally a matroid embedded in a projective space), we construct a sequence of varieties whose geometry encodes combinatorial information about G. For example, the chromatic polynomial of G (giving at each m>0 the…

Let $X$ be a smooth projective curve with genus $g\geq3$. Let $\mathcal{N}$ be the moduli space of stable rank two vector bundles on $X$ with a fixed determinant $\mathcal{O}_X(-x)$ for $x\in X$. In this paper, as a generalization of Kiem…

For any graph $G=(V,E)$ and positive integer $p$, the exact distance-$p$ graph $G^{[\natural p]}$ is the graph with vertex set $V$, which has an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance $p$ in $G$. For odd…

Let $G=(V(G), E(G))$ be a graph with maximum degree $\Delta$. For a subset $M$ of $E(G)$, we denote by $G[V(M)]$ the subgraph of $G$ induced by the endvertices of edges in $M$. We call $M$ a semistrong matching if each edge of $M$ is…

The rational Chow ring of the moduli space $\mathcal{M}_g$ of curves of genus $g$ is known for $g \leq 6$. Here, we determine the rational Chow rings of $\mathcal{M}_7, \mathcal{M}_8,$ and $\mathcal{M}_9$ by showing they are tautological.…

We continue the study of the Chow ring of the moduli stack $\mathfrak{M}_{g,n}$ of prestable curves begun in [arXiv:2012.09887v2]. In genus $0$, we show that the Chow ring of $\mathfrak{M}_{0,n}$ coincides with the tautological ring and…

The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials related to it. The location of the roots of these…

For every $n\geq 3, g\geq 1$ and all large enough $e$ depending on $n,g$, there exist curves of genus $g$, degree $e$ in a general hypersurface of degree $n$ in $\mathbb P^n$, or in $\mathbb P^n$ itself, whose whose normal bundle $N$ is…

The minimal model program suggests a compactification of the moduli space of hyperplane arrangements which is a moduli space of stable pairs. Here, a stable pair consists of a scheme X which is a degeneration of projective space and a…

An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We…

We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to…

The packing chromatic number $\chi_\rho(G)$ of a graph $G$ is the smallest integer $k$ needed to proper color the vertices of $G$ in such a way the distance between any two vertices having color $i$ be at least $i+1$. We obtain…

Let $\Omega=(\omega_{j})_{j\in I}$ be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus $g$ surface $S_{g}$, such that $\omega_{i}$ and $\omega_{j}$ intersect exactly once for $i\neq j$. It was…

An \emph{edge coloring} of a graph $G$ is strong if each color class is an induced matching of $G$. The \emph{strong chromatic index} of $G$, denoted by $\chi _{s}^{\prime }(G)$, is the minimum number of colors for which $G$ has a strong…

While there is much work and many conjectures surrounding the intersection theory of the moduli space of curves, relatively little is known about the intersection theory of the Hurwitz space $\mathcal{H}_{k, g}$ parametrizing smooth degree…

The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. This paper gives various results on…