Permutation Capacities and Oriented Infinite Paths

Autor:	Gábor Simonyi, Emanuela Fachini, Ágnes Tóth, Marianne Fairthorne, János Körner, Gérard D. Cohen, Graham Brightwell
Rok vydání:	2011
Předmět:	Combinatorics Discrete mathematics Permutation Channel capacity Mathematics::Combinatorics Applied Mathematics Discrete Mathematics and Combinatorics Permutation graph Directed graph Graph Computer Science::Information Theory Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 38:195-199
ISSN:	1571-0653
DOI:	10.1016/j.endm.2011.09.033
Popis:	The notion of permutation capacities is motivated by and shows similarities with the Shannon capacity of graphs and its generalization to directed graphs called Sperner capacity. We show that families of oriented paths have a different behaviour with respect to these capacities than Shannon and Sperner capacities and their generalization to graph families do. The talk is based on the paper [Brightwell, G., G. Cohen, E. Fachini, M. Fairthorne, J. Korner, G. Simonyi, and A. Toth, Permutation capacities of families of oriented infinite paths, SIAM J. Discrete Math. 24 (2010), 441-456].
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::156d5468142f707003be5472fbfa732a https://doi.org/10.1016/j.endm.2011.09.033 Zobrazit plný text záznamu Full Text from ScienceDirect