Olaf Parczyk

activity

20152023

most citedTriangles in randomly perturbed graphs

13 citations · 38 across the 15 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

3 papers · 2 filters

math.CO2022

A general approach to transversal versions of Dirac-type theorems

Pranshu Gupta, Fabian Hamann, Alp Müyesser +2

Given a collection of hypergraphs $H = (H_{1}, \dots, H_{m})$ with the same vertex set, an $m$ -edge graph $F \subset \cup_{i \in [m]} H_{i}$ is a transversal if there is a bijection $…

math.CO2022★ 1 cited

New Ramsey Multiplicity Bounds and Search Heuristics

Olaf Parczyk, Sebastian Pokutta, Christoph Spiegel +1

We study two related problems concerning the number of homogeneous subsets of given size in graphs that go back to questions of Erdős. Most notably, we improve the upper bounds on…

math.CO2022★ 1 cited

The square of a Hamilton cycle in randomly perturbed graphs

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

We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $α \in (0, 1)$ , the union of any $n$ -vertex graph wit…