Alp Muyesser

activity

20222026

most citedA random Hall-Paige conjecture

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

collaborators

10 papers

math.CO2026

Hamiltonicity of mildly pseudorandom regular graphs

Alp Müyesser

We show that if an $(n, d, λ)$ -graph satisfies $λ \leq (1 - δ) d$ and $d ≫ δ^{- 6} (lo g n)^{3}$ for some $δ > 0$ , then it is Hamiltonian. A qualitatively similar result was recently proven…

math.CO2026

Dirac subgraphs of powers of cycles are Hamiltonian

Richard Lang, Alp Müyesser, Mathias Schacht +1

We show that, for every $ε > 0$ and all sufficiently large $k$ , any spanning subgraph of the $k$ th power of a cycle with minimum degree at least $(1 + ε) k$ contains…

math.CO2026

The Lovász conjecture holds for moderately dense Cayley graphs

Benjamin Bedert, Nemanja Draganić, Alp Müyesser +1

We show that there is an absolute constant $c > 0$ such that every large connected $n$ -vertex Cayley graph with degree $d \geq n^{1 - c}$ has a Hamilton cycle. This makes progress towar…

math.CO2025

On the Graham--Sloane harmonious labelling conjecture

Alp Müyesser, Alexey Pokrovskiy

Consider an order $n$ abelian group $G$ and a tree $T$ on $n$ vertices. When is it possible to (bijectively) label $V (T)$ by $G$ so that along all edges $x y$ of $T$ , the sums $x + y$ …

math.CO2025

On Graham's rearrangement conjecture over $F_{2}^{n}$

Benjamin Bedert, Matija Bucić, Noah Kravitz +2

A sequence $s_{1}, s_{2}, \dots, s_{k}$ of elements of a group $G$ is called a valid ordering if the partial products $s_{1}, s_{1} s_{2}, \dots, s_{1} \dots s_{k}$ are all distinct. A long-standi…

math.CO2025

New bounds for linear arboricity and related problems

Micha Christoph, Nemanja Draganić, António Girão +3

A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $Δ$ can be decomposed into at most $\lceil(Δ+1)…

math.CO2025

Cyclic subsets in regular Dirac graphs

Nemanja Draganić, Peter Keevash, Alp Müyesser

In 1996, in his last paper, Erdős asked the following question that he formulated together with Faudree: is there a positive $c$ such that any $(n + 1)$ -regular graph $G$ on $2 n$ ver…

math.CO2025

Towards Graham's rearrangement conjecture via rainbow paths

Matija Bucić, Bryce Frederickson, Alp Müyesser +2

We study an old question in combinatorial group theory which can be traced back to a conjecture of Graham from 1971. Given a group $Γ$ , and some subset $S \subseteq Γ$ , is it possib…

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.CO2022★ 1 cited

A random Hall-Paige conjecture

Alp Müyesser, Alexey Pokrovskiy

A complete mapping of a group $G$ is a bijection $ϕ : G \to G$ such that $x \mapsto x ϕ (x)$ is also bijective. Hall and Paige conjectured in 1955 that a finite group $G$ has a com…

Hamiltonicity of mildly pseudorandom regular graphs

Dirac subgraphs of powers of cycles are Hamiltonian

The Lovász conjecture holds for moderately dense Cayley graphs

On the Graham--Sloane harmonious labelling conjecture

On Graham's rearrangement conjecture over F2n​

New bounds for linear arboricity and related problems

Cyclic subsets in regular Dirac graphs

Towards Graham's rearrangement conjecture via rainbow paths

Topological Minors in Typical Lifts

A random Hall-Paige conjecture

On Graham's rearrangement conjecture over $F_{2}^{n}$