Skip to Main content Skip to Navigation
Journal articles

On types of growth for graph-different permutations

Abstract : 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."
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Blerina Sinaimeri Connect in order to contact the contributor
Submitted on : Thursday, March 22, 2012 - 5:34:52 PM
Last modification on : Wednesday, November 3, 2021 - 2:18:08 PM
Long-term archiving on: : Saturday, June 23, 2012 - 2:40:53 AM


Files produced by the author(s)




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⟩



Record views


Files downloads