Alp Müyesser

activity

20182026

most citedColored unavoidable patterns and balanceable graphs

9 citations · 10 across the 9 of their papers we have counts for

collaborators

10 papers

math.CO2026

A proof of Andersen's rainbow path conjecture for large $n$

Candida Bowtell, Richard Montgomery, Alp Müyesser +1

We show that, for sufficiently large $n$ , every properly edge-coloured $n$ -vertex complete graph contains a path with $n - 1$ vertices which uses each colour at most once (that is, a…

math.CO2024

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…

math.CO2024

Spanning spheres in Dirac hypergraphs

Freddie Illingworth, Richard Lang, Alp Müyesser +2

We show that a $k$ -uniform hypergraph on $n$ vertices has a spanning subgraph homeomorphic to the $(k - 1)$ -dimensional sphere provided that $H$ has no isolated vertices and each s…

math.CO2023

Optimal spread for spanning subgraphs of Dirac hypergraphs

Tom Kelly, Alp Müyesser, Alexey Pokrovskiy

Let $G$ and $H$ be hypergraphs on $n$ vertices, and suppose $H$ has large enough minimum degree to necessarily contain a copy of $G$ as a subgraph. We give a general method to rand…

math.CO2023

Cycle type in Hall-Paige: A proof of the Friedlander-Gordon-Tannenbaum conjecture

Alp Müyesser

An orthomorphism of a finite group $G$ is a bijection $ϕ : G \to G$ such that $g \mapsto g^{- 1} ϕ (g)$ is also a bijection. In 1981, Friedlander, Gordon, and Tannenbaum conjectured…

math.CO2022

Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets

Michael Anastos, David Fabian, Alp Müyesser +1

We study multigraphs whose edge-sets are the union of three perfect matchings, $M_{1}$ , $M_{2}$ , and $M_{3}$ . Given such a graph $G$ and any $a_{1}, a_{2}, a_{3} \in N$ with $a_1+a_2+a_3…

math.CO2022

Unavoidable patterns in locally balanced colourings

Nina Kamčev, Alp Müyesser

Which patterns must a two-colouring of $K_{n}$ contain if each vertex has at least $ε n$ red and $ε n$ blue neighbours? In this paper, we investigate this questio…

math.CO2020★ 1 cited

On a colored Turán problem of Diwan and Mubayi

Ander Lamaison, Alp Müyesser, Michael Tait

Suppose that $R$ (red) and $B$ (blue) are two graphs on the same vertex set of size $n$ , and $H$ is some graph with a red-blue coloring of its edges. How large can $R$ and $B$ be i…

math.CO2019★ 9 cited

Colored unavoidable patterns and balanceable graphs

Matt Bowen, Adriana Hansberg, Amanda Montejano +1

We study a Turán-type problem on edge-colored complete graphs. We show that for any $r$ and $t$ , any sufficiently large $r$ -edge-colored complete graph on $n$ vertices with $Ω(n^{2…

math.CO2018

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 $K_{n}$ where each color is well-represented. Let $χ$ be a…

A proof of Andersen's rainbow path conjecture for large n