2 citations · 3 across the 4 of their papers we have counts for
12 papers · 1 filter
Minimum degree conditions for containing an -regular -connected subgraph
Max Hahn-Klimroth, Olaf Parczyk, Yury Person
We study optimal minimum degree conditions when an -vertex graph contains an -regular -connected subgraph. We prove for fixed and large the condition to be $δ(…
Resilience for tight Hamiltonicity
Peter Allen, Olaf Parczyk, Vincent Pfenninger
We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any and , we show that asymptotically almost surely, every…
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 in the randomly perturbed graph model, which is the union of a deterministic …
Positional games on randomly perturbed graphs
Dennis Clemens, Fabian Hamann, Yannick Mogge +1
Maker-Breaker games are played on a hypergraph , where denotes the family of winning sets. Both players alternately claim a predefined…
Anti-Ramsey threshold of cycles
Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar, Guilherme Oliveira Mota +1
For graphs and , let denote the property that for every proper edge colouring of there is a rainbow copy of in . Exte…
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 with minimum degree and the binomial random graph . T…