Decomposition of tournament limits
| Autor: | Thörnblad, Erik |
|---|---|
| Rok vydání: | 2016 |
| Předmět: | |
| Zdroj: | European Journal of Combinatorics, Volume 67, January 2018, Pages 96-125 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1016/j.ejc.2017.07.023 |
| Popis: | The theory of tournament limits and tournament kernels (often called graphons) is developed by extending common notions for finite tournaments to this setting; in particular we study transitivity and irreducibility of limits and kernels. We prove that each tournament kernel and each tournament limit can be decomposed into a direct sum of irreducible components, with transitive components interlaced. We also show that this decomposition is essentially unique. Comment: 31 pages; 3 figures |
| Databáze: | arXiv |
| Externí odkaz: |
|