860 research outputs found
The Shannon capacity of a graph and the independence numbers of its powers
The independence numbers of powers of graphs have been long studied, under
several definitions of graph products, and in particular, under the strong
graph product. We show that the series of independence numbers in strong powers
of a fixed graph can exhibit a complex structure, implying that the Shannon
Capacity of a graph cannot be approximated (up to a sub-polynomial factor of
the number of vertices) by any arbitrarily large, yet fixed, prefix of the
series. This is true even if this prefix shows a significant increase of the
independence number at a given power, after which it stabilizes for a while
Many copies in -free graphs
For two graphs and with no isolated vertices and for an integer ,
let denote the maximum possible number of copies of in an
-free graph on vertices. The study of this function when is a
single edge is the main subject of extremal graph theory. In the present paper
we investigate the general function, focusing on the cases of triangles,
complete graphs, complete bipartite graphs and trees. These cases reveal
several interesting phenomena. Three representative results are:
(i)
(ii) For any fixed , and ,
and
(iii) For any two trees and , where
is an integer depending on and (its precise definition is
given in Section 1).
The first result improves (slightly) an estimate of Bollob\'as and Gy\H{o}ri.
The proofs combine combinatorial and probabilistic arguments with simple
spectral techniques
Balanced Families of Perfect Hash Functions and Their Applications
The construction of perfect hash functions is a well-studied topic. In this
paper, this concept is generalized with the following definition. We say that a
family of functions from to is a -balanced -family
of perfect hash functions if for every , , the number
of functions that are 1-1 on is between and for some
constant . The standard definition of a family of perfect hash functions
requires that there will be at least one function that is 1-1 on , for each
of size . In the new notion of balanced families, we require the number
of 1-1 functions to be almost the same (taking to be close to 1) for
every such . Our main result is that for any constant , a
-balanced -family of perfect hash functions of size can be constructed in time .
Using the technique of color-coding we can apply our explicit constructions to
devise approximation algorithms for various counting problems in graphs. In
particular, we exhibit a deterministic polynomial time algorithm for
approximating both the number of simple paths of length and the number of
simple cycles of size for any
in a graph with vertices. The approximation is up to any fixed desirable
relative error
- β¦