Related papers: Limit shapes for Domain-Wall (colored) vertex mode…
In this paper, we study Dehn colorings for spatial graphs, and give a family of spatial graph invariants that are called vertex-weight invariants. We give some examples of spatial graphs that can be distinguished by a vertex-weight…
Suppose that the vertices of a graph $G$ are colored with two colors in an unknown way. The color that occurs on more than half of the vertices is called the majority color (if it exists), and any vertex of this color is called a majority…
The purpose of the present work is to provide a detailed asymptotic analysis of the $k\times\ell$ doubly periodic Aztec diamond dimer model of growing size for any $k$ and $\ell$ and under mild conditions on the edge weights. We explicitly…
A weighted coloured-edge graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such…
We obtain new results for the probabilistic model introduced in Menshikov et al (2007) and Volkov (2006) which involves a $d$-ary regular tree. All vertices are coloured in one of $d$ distinct colours so that $d$ children of each vertex all…
A variety of powerful extremal results have been shown for the chromatic number of triangle-free graphs. Three noteworthy bounds are in terms of the number of vertices, edges, and maximum degree given by Poljak \& Tuza (1994), and…
We study the octahedron relation (also known as the $A_{\infty}$ $T$-system), obeyed in particular by the partition function for dimer coverings of the Aztec Diamond graph. For a suitable class of doubly periodic initial conditions, we find…
In this paper we consider a class of probability distributions on the six-vertex model from statistical mechanics, which originate from the higher spin vertex models of https://arxiv.org/abs/1601.05770. We define operators, inspired by the…
We address the problem of sampling colorings of a graph $G$ by Markov chain simulation. For most of the article we restrict attention to proper $q$-colorings of a path on $n$ vertices (in statistical physics terms, the one-dimensional…
We investigate the bounded derived category of coherent sheaves on irreducible singular projective curves of arithmetic genus one. A description of the group of exact auto-equivalences and the set of all t-structures of this category is…
We consider the five-vertex model on a rectangular domain of the square lattice, with the so-called `scalar-product' boundary conditions. We address the evaluation of the free-energy density of the model in the scaling limit, that is when…
This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing's theorem states that the edge coloring of a simple graph $G$ requires either $\Delta$ or $\Delta+1$ colors,…
We consider a class of probability distributions on the six-vertex model, which originate from the higher spin vertex models in arXiv:1601.05770 and have previously been investigated in arXiv:1610.06893. For these random six-vertex models…
A complete partition of a graph $G$ is a partition of the vertex set such that there is at least one edge between any two parts. The largest $r$ such that $G$ has a complete partition into $r$ parts, each of which is an independent set, is…
We study graph coloring problems in the streaming model, where the goal is to process an $n$-vertex graph whose edges arrive in a stream, using a limited space that is smaller than the trivial $O(n^2)$ bound. While prior work has largely…
With the help of the Drinfeld twist or factorizing F-matrix for the eight-vertex SOS model, we obtain the explicit determinant expression of the partition function of the eight-vertex model with a generic non-diagonal reflecting end and…
We define Gaussian graphical models on directed acyclic graphs with coloured vertices and edges, calling them RDAG (restricted directed acyclic graph) models. If two vertices or edges have the same colour, their parameters in the model must…
We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like k log k for the graph of separating curves on a surface of Euler characteristic -k. We also show that the graph of curves that…
In this paper we study the concept of characteristic numbers and Chern slopes in the context of curve configurations in the real and complex projective plane. We show that some extremal line configurations inherit the same asymptotic…
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of view. The equivalence between \emph{optimization} and…