Max Hahn-Klimroth

collaborators

2 papers

math.CO2021

Minimum degree conditions for containing an $r$ -regular $r$ -connected subgraph

Max Hahn-Klimroth, Olaf Parczyk, Yury Person

We study optimal minimum degree conditions when an $n$ -vertex graph $G$ contains an $r$ -regular $r$ -connected subgraph. We prove for $r$ fixed and $n$ large the condition to be $δ(…

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…

Minimum degree conditions for containing an r-regular r-connected subgraph

Random perturbation of sparse graphs

Minimum degree conditions for containing an $r$ -regular $r$ -connected subgraph