691 research outputs found
On the chromatic roots of generalized theta graphs
The generalized theta graph \Theta_{s_1,...,s_k} consists of a pair of
endvertices joined by k internally disjoint paths of lengths s_1,...,s_k \ge 1.
We prove that the roots of the chromatic polynomial $pi(\Theta_{s_1,...,s_k},z)
of a k-ary generalized theta graph all lie in the disc |z-1| \le [1 + o(1)]
k/\log k, uniformly in the path lengths s_i. Moreover, we prove that
\Theta_{2,...,2} \simeq K_{2,k} indeed has a chromatic root of modulus [1 +
o(1)] k/\log k. Finally, for k \le 8 we prove that the generalized theta graph
with a chromatic root that maximizes |z-1| is the one with all path lengths
equal to 2; we conjecture that this holds for all k.Comment: LaTex2e, 25 pages including 2 figure
Chromatic roots are dense in the whole complex plane
I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l. The same holds for their dichromatic polynomials (alias Tutte polynomials, alias Potts-model partition functions) Z(G)(q,upsilon) outside the disc \q + upsilon\ < \upsilon\. An immediate corollary is that the chromatic roots of not-necessarily-planar graphs are dense in the whole complex plane. The main technical tool in the proof of these results is the Beraha-Kahane-Weiss theorem oil the limit sets of zeros for certain sequences of analytic functions, for which I give a new and simpler proof
Chromatic roots are dense in the whole complex plane
I show that the zeros of the chromatic polynomials P_G(q) for the generalized
theta graphs \Theta^{(s,p)} are, taken together, dense in the whole complex
plane with the possible exception of the disc |q-1| < 1. The same holds for
their dichromatic polynomials (alias Tutte polynomials, alias Potts-model
partition functions) Z_G(q,v) outside the disc |q+v| < |v|. An immediate
corollary is that the chromatic zeros of not-necessarily-planar graphs are
dense in the whole complex plane. The main technical tool in the proof of these
results is the Beraha-Kahane-Weiss theorem on the limit sets of zeros for
certain sequences of analytic functions, for which I give a new and simpler
proof.Comment: LaTeX2e, 53 pages. Version 2 includes a new Appendix B. Version 3
adds a new Theorem 1.4 and a new Section 5, and makes several small
improvements. To appear in Combinatorics, Probability & Computin
On the quantum chromatic number of a graph
We investigate the notion of quantum chromatic number of a graph, which is
the minimal number of colours necessary in a protocol in which two separated
provers can convince an interrogator with certainty that they have a colouring
of the graph.
After discussing this notion from first principles, we go on to establish
relations with the clique number and orthogonal representations of the graph.
We also prove several general facts about this graph parameter and find large
separations between the clique number and the quantum chromatic number by
looking at random graphs.
Finally, we show that there can be no separation between classical and
quantum chromatic number if the latter is 2, nor if it is 3 in a restricted
quantum model; on the other hand, we exhibit a graph on 18 vertices and 44
edges with chromatic number 5 and quantum chromatic number 4.Comment: 7 pages, 1 eps figure; revtex4. v2 has some new references; v3 furthe
small improvement
On chromatic roots of large subdivisions of graphs
AbstractGiven a graph G, we derive an expression for the chromatic polynomials of the graphs resulting from subdividing some (or all) of its edges. For special subfamilies of these, we are able to describe the limits of their chromatic roots. We also prove that for any ε>0, all sufficiently large subdivisions of G have their chromatic roots in |z−1|<1+ε. A consequence of our work will be a characterization of the graphs having a subdivision whose chromatic polynomial has a root with negative real part
On the location of chromatic zeros of series-parallel graphs
In this paper we consider the zeros of the chromatic polynomial of
series-parallel graphs. Complementing a result of Sokal, showing density
outside the disk , we show density of
these zeros in the half plane and we show there exists an open
region containing the interval such that does
not contain zeros of the chromatic polynomial of series-parallel graphs.
We also disprove a conjecture of Sokal by showing that for each large enough
integer there exists a series-parallel graph for which all vertices
but one have degree at most and whose chromatic polynomial has a zero
with real part exceeding .Comment: 18 pages, 2 figure
- …