Alp Müyesser

activity

20212026

most citedTransversal factors and spanning trees

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

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

Robustness and hyperstability for the Erdős-Gallai theorem

Micha Christoph, Alp Müyesser, Yuval Wigderson

The Erdős--Gallai theorem states that every graph of average degree $d$ contains a cycle of length at least $d$ . We prove the following robust extension of the Erdős--Gallai theore…

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.CO2021★ 2 cited

Transversal factors and spanning trees

Richard Montgomery, Alp Müyesser, Yanitsa Pehova

Given a collection of graphs $G = (G_{1}, \dots, G_{m})$ with the same vertex set, an $m$ -edge graph $H \subset \cup_{i \in [m]} G_{i}$ is a transversal if there is a bijection $ϕ:E…