On the permutation capacity of digraphs

Simple item page
dc.creatorCohen, Gerard
dc.creatorFachini, Emanuela
dc.creatorKorner, Janos
dc.date2008-09-09
dc.date.accessioned2026-07-07T10:01:43Z
dc.date.available2026-07-07T10:01:43Z
dc.descriptionWe extend several results of the third author and C. Malvenuto on graph-different permutations to the case of directed graphs and introduce new open problems. Permutation capacity is a natural extension of Sperner capacity from finite directed graphs to infinite digraphs. Our subject is combinatorial in nature, but can be equally regarded as zero-error information theory.
dc.description11 pages, no figures
dc.identifierhttps://arxiv.org/abs/0809.1522
dc.identifierhttp://arxiv.org/abs/0809.1522
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168722
dc.subjectCombinatorics
dc.subjectInformation Theory
dc.subject05D05; 05C69: 05C69; 94A24
dc.titleOn the permutation capacity of digraphs
dc.typetext

Files

Collections

arXiv