| Texto completo | |
| Autor(es): |
Coregliano, Leonardo Nagami
;
Razborov, Alexander A.
Número total de Autores: 2
|
| Tipo de documento: | Artigo Científico |
| Fonte: | JOURNAL OF GRAPH THEORY; v. 85, n. 1, p. 12-21, MAY 2017. |
| Citações Web of Science: | 4 |
| Resumo | |
We prove that for every fixedk, the number of occurrences of the transitive tournamentTr(k) of orderk in a tournamentTn onn vertices is asymptotically minimized whenTn is random. In the opposite direction, we show that any sequence of tournaments[Tn] achieving this minimum for any fixedk4 is necessarily quasirandom. We present several other characterizations of quasirandom tournaments nicely complementing previously known results and relatively easily following from our proof techniques. (C) 2016 Wiley Periodicals, Inc. (AU) | |
| Processo FAPESP: | 13/23720-9 - Combinatória Assintótica de Permutações e Álgebras de Flags |
| Beneficiário: | Leonardo Nagami Coregliano |
| Modalidade de apoio: | Bolsas no Brasil - Mestrado |
| Processo FAPESP: | 14/15134-5 - Permutações e álgebras de flags |
| Beneficiário: | Leonardo Nagami Coregliano |
| Modalidade de apoio: | Bolsas no Exterior - Estágio de Pesquisa - Mestrado |