Giulia S. Maesaka

collaborators

3 papers

math.CO2020

Random perturbation of sparse graphs

Max Hahn-Klimroth, Giulia S. Maesaka, Yannick Mogge +2

In the model of randomly perturbed graphs we consider the union of a deterministic graph $G_{α}$ with minimum degree $α n$ and the binomial random graph $G (n, p)$ . T…

math.CO2019

Embedding spanning subgraphs in uniformly dense and inseparable graphs

Oliver Ebsen, Giulia S. Maesaka, Christian Reiher +2

We consider sufficient conditions for the existence of $k$ -th powers of Hamiltonian cycles in $n$ -vertex graphs $G$ with minimum degree $μ n$ for arbitrarily small $μ > 0$ . About 20 y…

math.CO2019

The size-Ramsey number of powers of bounded degree trees

Sören Berger, Yoshiharu Kohayakawa, Giulia Satiko Maesaka +4

Given a positive integer $s$ , the $s$ -colour size-Ramsey number of a graph $H$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges with the property that,…