On types of growth for graph-different permutations

Details On types of growth for graph-different permutations On types of growth for graph-different permutations

2007-12-10

arxiv.org/abs/0712.1442v1

Mathematics

Combinatorics

14 pages+title page

Scientific paper

We consider an infinite graph G whose vertex set is the set of natural numbers and adjacency depends solely on the difference between vertices. We study the largest cardinality of a set of permutations of [n] any pair of which differ somewhere in a pair of adjacent vertices of G and determine it completely in an interesting special case. We give estimates for other cases and compare the results in case of complementary graphs. We also explore the close relationship between our problem and the concept of Shannon capacity "within a given type".

Affiliated with

Also associated with

No associations

Rating

On types of growth for graph-different permutations 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 On types of growth for graph-different permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On types of growth for graph-different permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405314