Olaf Parczyk

activity

20152021

most citedSpanning structures and universality in sparse hypergraphs

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

collaborators

Showing 2021Show all

3 papers · 1 filter

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.CO2021

Resilience for tight Hamiltonicity

Peter Allen, Olaf Parczyk, Vincent Pfenninger

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $γ > 0$ and $k \geq 3$ , we show that asymptotically almost surely, every…

math.CO2021

Cycle factors in randomly perturbed graphs

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia +1

We study the problem of finding pairwise vertex-disjoint copies of the $ℓ$ -vertex cycle $C_{ℓ}$ in the randomly perturbed graph model, which is the union of a deterministic $n$ …

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

Resilience for tight Hamiltonicity

Cycle factors in randomly perturbed graphs

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