Related papers: Stable curves and chromatic polynomials

We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results…

Motivated by the definition of linear coloring on simplicial complexes, recently introduced in the context of algebraic topology \cite{Civan}, and the framework through which it was studied, we introduce the linear coloring on graphs. We…

In this paper, we study all ways of constructing modular compactifications of the moduli space $\mathcal{M}_{g,n}$ of $n$-pointed smooth algebraic curves of genus $g$ by allowing markings to collide. We find that for any such…

We give an algebro-geometric derivation of the known intersection theory on the moduli space of stable rank 2 bundles of odd degree over a smooth curve of genus g. We lift the computation from the moduli space to a Quot scheme, where we…

This paper is the first in a series of four papers aiming to describe the (almost integral) Chow ring of $\bar{\mathcal{M}}_3$, the moduli stack of stable curves of genus $3$. In this paper, we introduce the moduli stack…

We construct an infinite collection of universal -- independent of $(g,n)$ -- polynomials in the Miller-Morita-Mumford classes $\kappa_m\in H^{2m}( \overline{\cal M}_{g,n},\bq)$, defined over the moduli space of genus $g$ stable curves with…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…

The degree chromatic polynomial $Pm(G,k)$ of a graph $G$ counts the number of $k$-colorings in which no vertex has $m$ adjacent vertices of its same color. We prove Humpert and Martin's conjecture on the leading terms of the degree…

We present the program Boundary, whose source files are available at http://people.sissa.it/~maggiolo/boundary/. Given two natural numbers g and n satisfying 2g+n-2>0, the program generates all genus g stable graphs with n unordered marked…

For a classical simple and simply connected group $G$, let $\mathcal{M}_{G,\omega}$ be the moduli space of $\omega$-semistable parabolic $G$-bundles on a complex smooth projective curve of genus $g$. We prove two results in this article:…

We introduce a new method of calculating intersections on \bar{M}_{g,n}, using localization of equivariant cohomology. As an application, we give a proof of Mirzakhani's recursion relation for calculating intersections of mixed psi and…

We present certain new properties about the intersection numbers on moduli spaces of curves $\bar{\sM}_{g,n}$, including a simple explicit formula of $n$-point functions and several new identities of intersection numbers. In particular we…

Let $G$ be a simple graph. The dominated coloring of $G$ is a proper coloring of $G$ such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of $G$ is called the dominated…

We prove that the number of curves of a fixed genus g over finite fields is a polynomial function of the size of the field if and only if g is at most 8. Furthermore, we determine for each positive genus g the smallest n such that the…

The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…

The proper chromatic number $\Vec{\chi}(G)$ of a graph $G$ is the minimum $k$ such that there exists an orientation of the edges of $G$ with all vertex-outdegrees at most $k$ and such that for any adjacent vertices, the outdegrees are…

A strong edge-coloring of a graph $G$ is a coloring of edges of $G$ such that every color class forms an induced matching. The strong chromatic index is the minimum number of colors needed to color the graph. The Ore-degree $\theta(G)$ of a…

The chromatic number $\chi(G)$ of a graph $G$, that is, the smallest number of colors required to color the vertices of $G$ so that no two adjacent vertices are assigned the same color, is a classic and extensively studied parameter. Here…

For a colour cluster $\C =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\dots,\mathcal{C}_\ell)$, $\mathcal{C}_i$ is a colour class, and $|\mathcal{C}_i|=r_i \geq 1$, we investigate a simple connected graph structure $G^{\C}$, which…

We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…