8 citations · 11 across the 19 of their papers we have counts for
4 papers · 2 filters
Packing densities of layered permutations and the minimum number of monotone sequences in layered permutations
Josefran de Oliveira Bastos, Leonardo Nagami Coregliano
In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from Hästö (2003) and Warren (2004) to compute the permutation packin…
On the maximum density of fixed strongly connected subtournaments
Leonardo N. Coregliano, Roberto F. Parente, Cristiane M. Sato
We study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as…
Quasi-Carousel Tournaments
Leonardo Nagami Coregliano
A tournament is called locally transitive if the outneighbourhood and the inneighbourhood of every vertex are transitive. Equivalently, a tournament is locally transitive if it avo…
On the Density of Transitive Tournaments
Leonardo Nagami Coregliano, Alexander A. Razborov
We prove that for every fixed , the number of occurrences of the transitive tournament of order in a tournament on vertices is asymptotically minimized when…