𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Potts Model on Infinite Graphs and the Limit of Chromatic Polynomials

✍ Scribed by Aldo Procacci; Benedetto Scoppola; Victor Gerasimov

Publisher
Springer
Year
2003
Tongue
English
Weight
221 KB
Volume
235
Category
Article
ISSN
0010-3616

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the chromatic polynomial of a graph
On the chromatic polynomial of a graph
✍ David Avis; Caterina De Simone; Paolo Nobili πŸ“‚ Article πŸ“… 2002 πŸ› Springer-Verlag 🌐 English βš– 121 KB
The fractional chromatic number of infin
The fractional chromatic number of infinite graphs
✍ Imre Leader πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 398 KB πŸ‘ 1 views

## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g

On chromatic uniqueness of two infinite
On chromatic uniqueness of two infinite families of graphs
✍ Feng-Ming Dong πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 229 KB πŸ‘ 1 views

## Abstract In this paper, it is proven that for each __k__ β‰₯ 2, __m__ β‰₯ 2, the graph Θ~__k__~(__m,…,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 ≀ __m__ ≀ __n__, the complete bipartite graph __K__~__m,n__~ is chr

On Οƒ-polynomials and a class of chromati
On Οƒ-polynomials and a class of chromatically unique graphs
✍ Qingyan Du πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi