4 papers
Inducibility and universality for trees
Timothy F. N. Chan, Daniel Kral, Bojan Mohar +1
We answer three questions posed by Bubeck and Linial on the limit densities of subtrees in trees. We prove there exist positive and such that every…
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…
Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
Timothy F. N. Chan, Jacob W. Cooper, Martin Koutecky +2
A long line of research on fixed parameter tractability of integer programming culminated with showing that integer programs with n variables and a constraint matrix with dual tree…
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…