27 citations · 73 across the 20 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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.PR2019
Embedding small digraphs and permutations in binary trees and split trees
Michael Albert, Cecilia Holmgren, Tony Johansson +1
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It…