On types of growth for graph-different permutations

Simple item page
dc.creatorKörner, János
dc.creatorSimonyi, Gábor
dc.creatorSinaimeri, Blerina
dc.date2007-12-10
dc.date.accessioned2026-07-07T08:48:15Z
dc.date.available2026-07-07T08:48:15Z
dc.descriptionWe 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".
dc.description14 pages+title page
dc.identifierhttps://arxiv.org/abs/0712.1442
dc.identifierhttp://arxiv.org/abs/0712.1442
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143878
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subject05D05
dc.titleOn types of growth for graph-different permutations
dc.typetext

Files

Collections

arXiv