On types of growth for graph-different permutations

János Körner (1) , Gábor Simonyi (2) , Blerina Sinaimeri (1)

1 UNIROMA - Università degli Studi di Roma "La Sapienza" = Sapienza University [Rome]
2 Alfréd Rényi Institute of Mathematics

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."

Mots clés: Extremal combinatorics; Permutations; Shannon capacity of graphs

Domaines: Mathématique discrète [cs.DM]; Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

János Körner, Gábor Simonyi, Blerina Sinaimeri. On types of growth for graph-different permutations. J. Comb. Theory, Ser. A, 2009, 116 (3), pp.713-723. ⟨10.1016/j.jcta.2008.11.003⟩. ⟨hal-00681907⟩