Name
Abstract | ||
|---|---|---|
For any positive integer n, we determine all connected digraphs G of size at most four, such that a transitive tournament of order n is G-decomposable. Among others, these results disprove a generalization of a theorem of Sali and Simonyi [Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities, European J. Combin. 20 (1999), 93-99]. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.disc.2005.11.045 | Discrete Mathematics |
Keywords | Field | DocType |
05c35,transitive tournaments,05c70,decomposition,shannon capacity | Integer,Discrete mathematics,Graph,Combinatorics,Tournament,Transitive reduction,Directed graph,Mathematics,Transitive relation | Journal |
Volume | Issue | ISSN |
307 | 7-8 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Agnieszka Görlich | 1 | 27 | 9.19 |
| Rafał Kalinowski | 2 | 48 | 10.75 |
| Mariusz Meszka | 3 | 30 | 16.21 |
| Monika Pilśniak | 4 | 28 | 9.31 |
| Mariusz Woźniak | 5 | 204 | 34.54 |