Related papers: Lattice approach to plane colorings
The work is devoted to one of the variations of the Hadwiger--Nelson problem on the chromatic number of the plane. In this formulation one needs to find for arbitrarily small $\varepsilon$ the least possible number of colors needed to color…
Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le \chi(G)\le 7$. The upper bound of 7 is obtained using tilings of the…
This paper discusses reformulations of the problem of coloring plane maps with four colors. We give a number of alternate ways to formulate the coloring problem including a tautological expansion similar to the Penrose Bracket, and an…
A {\em conflict-free coloring} of a graph {\em with respect to open} (resp., {\em closed}) {\em neighborhood} is a coloring of vertices such that for every vertex there is a color appearing exactly once in its open (resp., closed)…
A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$. If the coloring is required to be proper, then the upper bound for the…
We address the problem of finding harmonic colors, this problem has many applications, from fashion to industrial design. In order to solve this problem we consider that colors follow normal distributions in tone (chroma and lightness) and…
The Hadwiger-Nelson problem asks for the minimum number of colors, so that each point of the plane can be assigned a single color with the property that no two points unit-distance apart are identically colored. It is now known that the…
We provide a human-verifiable proof that, in a certain sense, the chromatic number of the plane is exactly 7.
Vertex colouring is a well-known problem in combinatorial optimisation, whose alternative integer programming formulations have recently attracted considerable attention. This paper briefly surveys seven known formulations of vertex…
Color sequences, ordered sets of colors for data visualization, that balance aesthetics with accessibility considerations are presented. In order to model aesthetic preference, data were collected with an online survey, and the results were…
We introduce a non-disordered lattice spin model, based on the principle of minimizing spin-spin correlations up to a (tunable) distance R. The model can be defined in any spatial dimension D, but already for D=1 and small values of R (e.g.…
We construct a lattice theory describing a system of interacting nonrelativistic spin s=1/2 fermions at nonzero chemical potential. The theory is applicable whenever the interparticle separation is large compared to the range of the…
In this work, we consider a number of problems defined on the triangular lattice with $n$ rows, which we will denote as $T_n$. Define a \textit{proper coloring} to be an assignment of colors to the points of $T_n$ such that no three points…
Consider the graph $\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to…
A well-known result by Graham in Euclidean Ramsey Theory states that, for every positive real number $A$, every coloring of the plane with finite number of colors contains a monochromatic triangle of area $A$. We consider canonical versions…
The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise…
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…
We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…
In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the number of vertices colored with each color differs by at most one, and the least number of colors for which…
The list coloring problem is a variant of vertex coloring where a vertex may be colored only a color from a prescribed set. Several applications of vertex coloring are more appropriately modelled as instances of list coloring and thus we…