Alp Müyesser

most citedApproximate path decompositions of regular graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2024

Topological Minors in Typical Lifts

Matija Bucić, Micha Christoph, Alp Müyesser +1

An $ℓ$ -lift of a graph $G$ is any graph obtained by replacing every vertex of $G$ with an independent set of size $ℓ$ , and connecting every pair of two such independent sets…

math.CO2024★ 1 cited

Approximate path decompositions of regular graphs

Richard Montgomery, Alp Müyesser, Alexey Pokrovskiy +1

We show that the edges of any $d$ -regular graph can be almost decomposed into paths of length roughly $d$ , giving an approximate solution to a problem of Kotzig from 1957. Along th…

math.CO2023

Spanning trees in pseudorandom graphs via sorting networks

Joseph Hyde, Natasha Morrison, Alp Müyesser +1

We show that $(n, d, λ)$ -graphs with $λ = O (d / lo g^{3} n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due t…

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…