1,464 research outputs found
k-tuple colorings of the Cartesian product of graphs
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest t so that there is a k-tuple coloring of G using t colors. It is well known that χ(G□H)=max{χ(G),χ(H)}. In this paper, we show that there exist graphs G and H such that χk(G□H)>max{χk(G),χk(H)} for k≥2. Moreover, we also show that there exist graph families such that, for any k≥1, the k-tuple chromatic number of their Cartesian product is equal to the maximum k-tuple chromatic number of its factors.Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Koch, Ivo Valerio. Universidad Nacional de General Sarmiento. Instituto de Industria; ArgentinaFil: Torres, Pablo. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Rosario; ArgentinaFil: Valencia Pabon, Mario. Universite de Paris 13-Nord; Francia. Centre National de la Recherche Scientifique; Franci
Kochen-Specker Sets and the Rank-1 Quantum Chromatic Number
The quantum chromatic number of a graph is sandwiched between its
chromatic number and its clique number, which are well known NP-hard
quantities. We restrict our attention to the rank-1 quantum chromatic number
, which upper bounds the quantum chromatic number, but is
defined under stronger constraints. We study its relation with the chromatic
number and the minimum dimension of orthogonal representations
. It is known that . We
answer three open questions about these relations: we give a necessary and
sufficient condition to have , we exhibit a class of
graphs such that , and we give a necessary and
sufficient condition to have . Our main tools are
Kochen-Specker sets, collections of vectors with a traditionally important role
in the study of noncontextuality of physical theories, and more recently in the
quantification of quantum zero-error capacities. Finally, as a corollary of our
results and a result by Avis, Hasegawa, Kikuchi, and Sasaki on the quantum
chromatic number, we give a family of Kochen-Specker sets of growing dimension.Comment: 12 page
Boxicity and Cubicity of Product Graphs
The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such
that G can be represented as an intersection graph of axis-parallel rectangular
boxes (axis-parallel unit cubes) in . In this article, we give estimates
on the boxicity and the cubicity of Cartesian, strong and direct products of
graphs in terms of invariants of the component graphs. In particular, we study
the growth, as a function of , of the boxicity and the cubicity of the
-th power of a graph with respect to the three products. Among others, we
show a surprising result that the boxicity and the cubicity of the -th
Cartesian power of any given finite graph is in and
, respectively. On the other hand, we show that there
cannot exist any sublinear bound on the growth of the boxicity of powers of a
general graph with respect to strong and direct products.Comment: 14 page
Packing chromatic vertex-critical graphs
The packing chromatic number of a graph is the smallest
integer such that the vertex set of can be partitioned into sets ,
, where vertices in are pairwise at distance at least .
Packing chromatic vertex-critical graphs, -critical for short, are
introduced as the graphs for which
holds for every vertex of . If , then is
--critical. It is shown that if is -critical,
then the set can be almost
arbitrary. The --critical graphs are characterized, and
--critical graphs are characterized in the case when they
contain a cycle of length at least which is not congruent to modulo
. It is shown that for every integer there exists a
--critical tree and that a --critical
caterpillar exists if and only if . Cartesian products are also
considered and in particular it is proved that if and are
vertex-transitive graphs and , then is -critical
On embeddings of CAT(0) cube complexes into products of trees
We prove that the contact graph of a 2-dimensional CAT(0) cube complex of maximum degree can be coloured with at most
colours, for a fixed constant . This implies
that (and the associated median graph) isometrically embeds in the
Cartesian product of at most trees, and that the event
structure whose domain is admits a nice labeling with
labels. On the other hand, we present an example of a
5-dimensional CAT(0) cube complex with uniformly bounded degrees of 0-cubes
which cannot be embedded into a Cartesian product of a finite number of trees.
This answers in the negative a question raised independently by F. Haglund, G.
Niblo, M. Sageev, and the first author of this paper.Comment: Some small corrections; main change is a correction of the
computation of the bounds in Theorem 1. Some figures repaire
Exact T=0 Partition Functions for Potts Antiferromagnets on Sections of the Simple Cubic Lattice
We present exact solutions for the zero-temperature partition function of the
-state Potts antiferromagnet (equivalently, the chromatic polynomial ) on
tube sections of the simple cubic lattice of fixed transverse size and arbitrarily great length , for sizes and and boundary conditions (a) and (b)
, where () denote free (periodic) boundary
conditions. In the limit of infinite-length, , we calculate the
resultant ground state degeneracy per site (= exponent of the ground-state
entropy). Generalizing from to , we determine
the analytic structure of and the related singular locus which
is the continuous accumulation set of zeros of the chromatic polynomial. For
the limit of a given family of lattice sections, is
analytic for real down to a value . We determine the values of
for the lattice sections considered and address the question of the value of
for a -dimensional Cartesian lattice. Analogous results are presented
for a tube of arbitrarily great length whose transverse cross section is formed
from the complete bipartite graph .Comment: 28 pages, latex, six postscript figures, two Mathematica file
- …