Related papers: Color representations of Ising models
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…
Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…
An \emph{equitable coloring} of a graph is a proper vertex coloring such that the sizes of every two color classes differ by at most 1. Chen, Lih, and Wu conjectured that every connected graph $G$ with maximum degree $\Delta \geq 2$ has an…
In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $c$ such that there exists a…
In an improper colouring an edge $uv$ for which, $c(u)=c(v)$ is called a \emph{bad edge}. The notion of the \emph{chromatic completion number} of a graph $G$ denoted by $\zeta(G),$ is the maximum number of edges over all chromatic…
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…
In this thesis, we present results on phase transition for two models: the semi-infinite Ising model with a decaying field, and the long-range Ising model with a random field. We study the semi-infinite Ising model with an external field…
A constrained colouring or, more specifically, an $(\alpha,\beta)$-colouring of a hypergraph $H$, is an assignment of colours to its vertices such that no edge of $H$ contains less than $\alpha$ or more than $\beta$ vertices with different…
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,…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…
A modified version of a finite random field Ising ferromagnetic model in an external magnetic field at zero temperature is presented to describe group decision making. Fields may have a non-zero average. A postulate of minimum…
We study the \emph{maximum differential coloring problem}, where the vertices of an $n$-vertex graph must be labeled with distinct numbers ranging from $1$ to $n$, so that the minimum absolute difference between two labels of any two…
We study ferromagnetic Ising models on finite graphs with an inhomogeneous external field, where a subset of vertices is designated as the boundary. We show that the influence of boundary conditions on any given spin is maximised when the…
An \emph{acyclic edge-coloring} of a graph $G$ is a proper edge-coloring of $G$ such that the subgraph induced by any two color classes is acyclic. The \emph{acyclic chromatic index}, $\chi'_a(G)$, is the smallest number of colors allowing…
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove…
The aim of this paper is to prove central limit theorems with respect to the annealed measure for the magnetization rescaled by $\sqrt{N}$ of Ising models on random graphs. More precisely, we consider the general rank-1 inhomogeneous random…
It is known that, for an oriented hypergraph with (vertex) coloring number $\chi$ and smallest and largest normalized Laplacian eigenvalues $\lambda_1$ and $\lambda_N$, respectively, the inequality $\chi\geq…
We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to…