4 papers
Random embeddings of bounded degree trees with optimal spread
Paul Bastide, Clément Legrand-Duchesne, Alp Müyesser
A seminal result of Komlós, Sárközy, and Szemerédi states that any n-vertex graph G with minimum degree at least (1/2 + α)n contains every n-vertex tree T of bounded degree. Recent…
Unavoidable patterns in locally balanced colourings
Nina Kamčev, Alp Müyesser
Which patterns must a two-colouring of contain if each vertex has at least red and blue neighbours? In this paper, we investigate this questio…
On a colored Turán problem of Diwan and Mubayi
Ander Lamaison, Alp Müyesser, Michael Tait
Suppose that (red) and (blue) are two graphs on the same vertex set of size , and is some graph with a red-blue coloring of its edges. How large can and be i…
Finding unavoidable colorful patterns in multicolored graphs
Matthew Bowen, Ander Lamaison, Alp Müyesser
We provide multicolored and infinite generalizations for a Ramsey-type problem raised by Bollobás, concerning colorings of where each color is well-represented. Let be a…