35 citations · 160 across the 27 of their papers we have counts for
Showing 2019Show all
3 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.CO2019★ 1 cited
Sharp bounds for decomposing graphs into edges and triangles
Adam Blumenthal, Bernard Lidický, Yanitsa Pehova +3
For a real constant , let be the minimum of twice the number of 's plus times the number of 's over all edge decompositions of into copies of …
math.CO2019
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…