984 research outputs found
Lower Bounds for the Graph Homomorphism Problem
The graph homomorphism problem (HOM) asks whether the vertices of a given
-vertex graph can be mapped to the vertices of a given -vertex graph
such that each edge of is mapped to an edge of . The problem
generalizes the graph coloring problem and at the same time can be viewed as a
special case of the -CSP problem. In this paper, we prove several lower
bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main
result is a lower bound .
This rules out the existence of a single-exponential algorithm and shows that
the trivial upper bound is almost asymptotically
tight.
We also investigate what properties of graphs and make it difficult
to solve HOM. An easy observation is that an upper
bound can be improved to where
is the minimum size of a vertex cover of . The second
lower bound shows that the upper bound is
asymptotically tight. As to the properties of the "right-hand side" graph ,
it is known that HOM can be solved in time and
where is the maximum degree of
and is the treewidth of . This gives
single-exponential algorithms for graphs of bounded maximum degree or bounded
treewidth. Since the chromatic number does not exceed
and , it is natural to ask whether similar
upper bounds with respect to can be obtained. We provide a negative
answer to this question by establishing a lower bound for any
function . We also observe that similar lower bounds can be obtained for
locally injective homomorphisms.Comment: 19 page
Essentially disjoint families, conflict free colorings and Shelah's Revised GCH
Using Shelah's revised GCH theorem we prove that if mu<beth_omega <= lambda
are cardinals, then every mu-almost disjoint subfamily B of
[lambda]^{beth_omega} is essentially disjoint, i.e. for each b from B there is
a subset f(b) of b of size < |b| such that the family {b-f(b) b in B} is
disjoint.
We also show that if mu<=kappa<=lambda, and kappa is infinite, and (x) every
mu-almost disjoint subfamily of [lambda]^kappa is essentially disjoint, then
(xx) every mu-almost disjoint family B of subsets of lambda with |b|>=kappa for
all b from B has a conflict-free colorings with kappa colors.
Putting together these results we obtain that if mu<beth_omega<=lambda, then
every mu-almost disjoint family B of subsets of lambda with |b|>=beth_omega for
all b from B has a conflict-free colorings with beth_omega colors.
To yield the above mentioned results we also need to prove a certain
compactness theorem concerning singular cardinals.Comment: 10 pages, minor correction
Universal immersion spaces for edge-colored graphs and nearest-neighbor metrics
There exist finite universal immersion spaces for the following: (a) Edge-colored graphs of bounded degree and boundedly many colors. (b) Nearest-neighbor metrics of bounded degree and boundedly many edge lengths
- …