Related papers: On four state Hard Core Models on the Cayley Tree

An independent set may not contain both a vertex and one of its neighbours. This basic fact makes the uniform distribution over independent sets rather special. We consider the hard-core model, an essential generalization of the uniform…

We consider the random graph $G_{n, {\bf d}}$ chosen uniformly at random from the set of all graphs with a given sparse degree sequence ${\bf d}$. We assume ${\bf d}$ has minimum degree at least 4, at most a power law tail, and place one…

We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\lambda^{|I|}$, for a positive real parameter $\lambda$. For large $\lambda$, computing the partition…

We consider a nearest-neighbor SOS model, spin values $0,1,..., m$, $m\geq 2$, on a Cayley tree of order $k$ . We mainly assume that $m=2$ and study translation-invariant (TI) and `splitting' (S) Gibbs measures (GMs). For $m=2$, in the…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

We study the problems of counting copies and induced copies of a small pattern graph $H$ in a large host graph $G$. Recent work fully classified the complexity of those problems according to structural restrictions on the patterns $H$. In…

In the present paper we consider countable state $p$-adic Potts model on the Cayley tree. A construction of $p$-adic Gibbs measures which depends on weights $\l$ is given, and an investigation of such measures is reduced to examination of…

There are many research works devoted to Gibbs measure for models on Cayley trees. Among these works, there are some works in which the general results are identical, but the considered models are various. In this article, we present the…

In this paper we analyze the ground state phase diagram of a class of fermionic Hamiltonians by looking at the fidelity of ground states corresponding to slightly different Hamiltonian parameters. The Hamiltonians under investigation can be…

We perform a rigorous study of the Gibbs statistics of high-density hard-core random configurations on a unit triangular lattice $\mathbb{A}_2$ and a unit honeycomb graph $\mathbb{H}_2$, for any value of the (Euclidean) repulsion diameter…

Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…

In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…

The closure of a graph $G$ is the graph $G^*$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the number of vertices of $G$. The well-known Closure Lemma…

The phase transition phenomenon is one of the central problems of statistical mechanics. It occurs when the model possesses multiple Gibbs measures. In this paper, we consider a three-state SOS (solid-on-solid) model on a Cayley tree. We…

Let $n \geq 1$ and assume that there is a Woodin cardinal. For $x \in \mathbb{R}$ let $\alpha_x$ be the least $\beta$ such that \[ L_\beta [x] \models \Sigma_n \text{-KP} + \exists \kappa (``\kappa \text{ is inaccessible and }\kappa^+…

For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian if the removal of any $k\le s$ vertices results in a Hamiltonian graph. Given a connected simple graph $G$ that is not isomorphic to a path, a cycle, or a $K_{1,3}$,…

$H_q(n,d)$ is defined as the graph with vertex set ${\mathbb Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$.…

This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic…