On types of growth for graph-different permutations

JOURNAL OF COMBINATORIAL THEORY SERIES A

卷:116

Article

Koerner, Janos¹  Simonyi, Gabor²  Sinaimeri, Blerina¹ 

[1] Univ Roma La Sapienza, Dept Comp Sci, Rome, Italy

[2] Hungarian Acad Sci, Alfred Renyi Inst Math, H-1051 Budapest, Hungary

关键词: Extremal combinatorics;    Permutations;    Shannon capacity of graphs;   

DOI  :  10.1016/j.jcta.2008.11.003

来源: Elsevier

【 摘 要 】

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 In I 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. (C) 2008 Elsevier Inc. All rights reserved.

【 授权许可】

Free