8 citations · 61 across the 28 of their papers we have counts for
3 papers · 1 filter
Characterization of quasirandom permutations by a pattern sum
Timothy F. N. Chan, Daniel Kral, Jonathan A. Noel +3
It is known that a sequence Pi_i of permutations is quasirandom if and only if the pattern density of every 4-point permutation in Pi_i converges to 1/24. We show that there is a s…
Bounding the number of cycles in a graph in terms of its degree sequence
Zdeněk Dvořák, Natasha Morrison, Jonathan A. Noel +2
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Király and Arman and Tsatur…
Cycles of length three and four in tournaments
Timothy F. N. Chan, Andrzej Grzesik, Daniel Kral +1
Linial and Morgenstern conjectured that, among all -vertex tournaments with cycles of length three, the number of cycles of length four is asymptotically minimiz…