Related papers: Stable curves and chromatic polynomials

We prove that on a closed surface of genus $g$, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is $\lesssim g^2 \log(g)$. This bound matches the largest known constructions to…

A dynamic coloring of a graph $G$ is a proper coloring such that for every vertex $v\in V(G)$ of degree at least 2, the neighbors of $v$ receive at least 2 colors. It was conjectured [B. Montgomery. {\em Dynamic coloring of graphs}. PhD…

We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…

As shown in a previous paper, certain naturally arising cones of holomorphic vector bundle sections over the main component $\ov\M_{1,k}^0(\P,d)$ of the moduli space of stable genus-one holomorphic maps into $\P$ have a well-defined euler…

Motivated by Stanley's generalization of the chromatic polynomial of a graph to the chromatic symmetric function, we introduce the characteristic polynomial of a representation of the symmetric group, or more generally, of a symmetric…

The proper conflict-free chromatic number, $\chi_{pcf}(G)$, of a graph $G$ is the least $k$ such that $G$ has a proper $k$-coloring in which for each non-isolated vertex there is a color appearing exactly once among its neighbors. The…

Let the {\it bicoloring cover number $\chi^c(G)$} for a hypergraph $G(V,E)$ be the minimum number of bicolorings of vertices of $G$ such that every hyperedge $e\in E$ of $G$ is properly bicolored in at least one of the $\chi^c(G)$…

A collection of graphs is \textit{nearly disjoint} if every pair of them intersects in at most one vertex. We prove that if $G_1, \dots, G_m$ are nearly disjoint graphs of maximum degree at most $D$, then the following holds. For every…

The chromatic vertex (resp.\ edge) stability number ${\rm vs}_{\chi}(G)$ (resp.\ ${\rm es}_{\chi}(G)$) of a graph $G$ is the minimum number of vertices (resp.\ edges) whose deletion results in a graph $H$ with $\chi(H)=\chi(G)-1$. In the…

$\chi$-bounded classes are studied here in the context of star colorings and more generally $\chi_p$-colorings. This leads to natural extensions of the notion of bounded expansion class and to structural characterization of these. In this…

A graph class is $\chi$-bounded if the only way to force large chromatic number in graphs from the class is by forming a large clique. In the 1970s, Erd\H{o}s conjectured that intersection graphs of straight-line segments in the plane are…

We study the moduli space $\mathcal{AS}_{g}$ of Artin-Schreier curves of genus $g$ over an algebraically closed field $k$ of positive characteristic $p$. The moduli space is partitioned by irreducible strata, where each stratum…

In this paper we find chromatic numbers of distance graphs $G(n,3,2)$ for infinitely many n. Also we improve upper bound for $\chi(G(n,r,s))$ in large part of cases.

We advertise elementary symmetric polynomials $e_i$ as the natural basis for generating series $A_{g,n}$ of intersection numbers of genus g and n marked points. Closed formulae for $A_{g,n}$ are known for genera $0$ and $1$ -- this approach…

If $G$ is a $k$-chromatic graph of order $n$ then it is known that the chromatic polynomial of $G$, $\pi(G,x)$, is at most $x(x-1)\cdots (x-(k-1))x^{n-k} = (x)_{\downarrow k}x^{n-k}$ for every $x\in \mathbb{N}$. We improve here this bound…

Given independent random points $X_1,...,X_n\in\eR^d$ with common probability distribution $\nu$, and a positive distance $r=r(n)>0$, we construct a random geometric graph $G_n$ with vertex set $\{1,...,n\}$ where distinct $i$ and $j$ are…

Let $\overline{\mathcal{M}}_{g,n}$ be the moduli stack parametrizing Deligne-Mumford stable $n$-pointed genus $g$ curves and let $\overline{M}_{g,n}$ be its coarse moduli space: the Deligne-Mumford compactification of the moduli space of…

We compute the intersection cohomology of the moduli spaces $M_{r,d}$ of semistable vector bundles having rank $r$ and degree $d$ over a curve. We do this by relating the Hodge-Deligne polynomial of the intersection cohomology of $M_{r,d}$…

Let $G$ be a graph with maximum degree $\Delta$ and without isolated vertices. An edge colouring $c$ of $G$ is conflict-free if the closed neighbourhood of every edge includes a uniquely coloured element. The least number of colours…

Let $C$ be an algebraic curve of genus $g$. A coherent system on $C$ consists of a pair $(E,V)$, where $E$ is an algebraic vector bundle over $C$ of rank $n$ and degree $d$ and $V$ is a subspace of dimension $k$ of the space of sections of…