10 citations · 10 across the 1 of their papers we have counts for
3 papers
math.CO2019★ 10 cited
No additional tournaments are quasirandom-forcing
Robert Hancock, Adam Kabela, Daniel Kral +4
A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density…
math.CO2016
Packing arborescences in random digraphs
Carlos Hoppen, Roberto F. Parente, Cristiane M. Sato
We study the problem of packing arborescences in the random digraph , where each possible arc is included uniformly at random with probability . Let $λ(\ma…
math.CO2015
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…