6 citations · 8 across the 7 of their papers we have counts for
10 papers · 1 filter
Hamilton decompositions of regular tripartite tournaments
Francesco Di Braccio, Joanna Lada, Viresh Patel +2
Kühn and Osthus conjectured in 2013 that regular tripartite tournaments are decomposable into Hamilton cycles. Somewhat surprisingly, Granet gave a simple counterexample to this co…
A framework for the generalised Erdős-Rothschild problem and a resolution of the dichromatic triangle case
Pranshu Gupta, Yani Pehova, Emil Powierski +1
The Erdős-Rothschild problem from 1974 asks for the maximum number of -edge colourings in an -vertex graph which avoid a monochromatic copy of , given positive integers…
Universality for transversal Hamilton cycles
Candida Bowtell, Patrick Morris, Yanitsa Pehova +1
Let be a graph collection on a common vertex set of size such that for every . We show that $\mathbf{…
Embedding loose spanning trees in 3-uniform hypergraphs
Yanitsa Pehova, Kalina Petrova
In 1995, Komlós, Sárközy and Szemerédi showed that every large -vertex graph with minimum degree at least contains all spanning trees of bounded degree. We consider…
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…
On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem
Rajko Nenadov, Yanitsa Pehova
A seminal result of Hajnal and Szemerédi states that if a graph with vertices has minimum degree for some integer , then contains a -f…
Decomposing graphs into edges and triangles
Daniel Král', Bernard Lidický, Taísa L. Martins +1
We prove the following 30-year old conjecture of Győri and Tuza: the edges of every -vertex graph can be decomposed into complete graphs of orders two an…