6 citations · 8 across the 7 of their papers we have counts for
4 papers · 1 filter
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 …
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…
An approximate version of Jackson's conjecture
Anita Liebenau, Yanitsa Pehova
In 1981 Jackson showed that the diregular bipartite tournament (a complete bipartite graph whose edges are oriented so that every vertex has the same in- and outdegree) contains a…
Ramsey numbers of ordered graphs under graph operations
Jesse Geneson, Amber Holmes, Xujun Liu +3
An ordered graph is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of is the smallest integer such that…