On the permutation capacity of digraphs
Combinatorics
2008-09-10 v1 Information Theory
math.IT
Abstract
We 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.
Keywords
Cite
@article{arxiv.0809.1522,
title = {On the permutation capacity of digraphs},
author = {Gerard Cohen and Emanuela Fachini and Janos Korner},
journal= {arXiv preprint arXiv:0809.1522},
year = {2008}
}
Comments
11 pages, no figures