On the permutation capacity of digraphs

Details On the permutation capacity of digraphs On the permutation capacity of digraphs

2008-09-09

arxiv.org/abs/0809.1522v1

Mathematics

Combinatorics

11 pages, no figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the permutation capacity of digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the permutation capacity of digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the permutation capacity of digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210579