| Full text | |
| Author(s): |
Coregliano, Leonardo Nagami
;
Razborov, Alexander A.
Total Authors: 2
|
| Document type: | Journal article |
| Source: | JOURNAL OF GRAPH THEORY; v. 85, n. 1, p. 12-21, MAY 2017. |
| Web of Science Citations: | 4 |
| Abstract | |
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) | |
| FAPESP's process: | 13/23720-9 - The Asymptotic Combinatorics of Permutations and Flag Algebras |
| Grantee: | Leonardo Nagami Coregliano |
| Support Opportunities: | Scholarships in Brazil - Master |
| FAPESP's process: | 14/15134-5 - Permutations and flag algebras |
| Grantee: | Leonardo Nagami Coregliano |
| Support Opportunities: | Scholarships abroad - Research Internship - Master's degree |