Name
Abstract | ||
|---|---|---|
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. Körner, G. Simonyi, and Á. Tóth, Permutation capacities of families of oriented infinite paths, SIAM J. Discrete Math. 24 (2010), 441–456]. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.endm.2011.09.033 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
graph capacities,permutations,digraphs,Andréʼs problem | Permutation graph,Discrete mathematics,Graph,Combinatorics,Permutation,Directed graph,Channel capacity,Mathematics | Journal |
Volume | ISSN | Citations |
38 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 7 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Graham Brightwell | 1 | 306 | 37.33 |
| Gérard Cohen | 2 | 877 | 176.34 |
| Emanuela Fachini | 3 | 39 | 11.83 |
| Marianne Fairthorne | 4 | 9 | 1.32 |
| János Korner | 5 | 138 | 20.27 |
| Gábor Simonyi | 6 | 249 | 29.78 |
| Ágnes Tóth | 7 | 19 | 3.92 |