Random Graph-Homomorphisms and Logarithmic Degree

Details Random Graph-Homomorphisms and Logarithmic Degree Random Graph-Homomorphisms and Logarithmic Degree

2006-11-14

arxiv.org/abs/math/0611416v2

Electronic Journal of Probability, 12 (2007), 926--950

Mathematics

Probability

Scientific paper

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the infinite line Z. It is shown that if the maximal degree of G is `sub-logarithmic', then the range of such a homomorphism is super-constant. Furthermore, some examples are provided, suggesting that perhaps for graphs with super-logarithmic degree, the range of a typical homomorphism is bounded. In particular, a sharp transition is shown for a specific family of graphs C_{n,k} (which is the tensor product of the n-cycle and a complete graph, with self-loops, of size k). That is, given any function psi(n) tending to infinity, the range of a typical homomorphism of C_{n,k} is super-constant for k = 2 log(n) - psi(n), and is 3 for k = 2 log(n) + psi(n).

Affiliated with

Also associated with

No associations

Rating

Random Graph-Homomorphisms and Logarithmic Degree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Graph-Homomorphisms and Logarithmic Degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Graph-Homomorphisms and Logarithmic Degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-488052