papers
Publications (7)
math.CO2019
Semi-random graph process
Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg +3
math.CO2019
Embedding spanning bounded degree graphs in randomly perturbed graphs
Julia Böttcher, Richard Montgomery, Olaf Parczyk +1
The paper develops an absorption-based method for embedding spanning bounded-degree graphs and powers of Hamilton cycles into randomly perturbed dense graphs, showing that these em…
#randomly perturbed graphs#spanning subgraph embedding#bounded degree graphs#Hamilton cycle powers
math.CO2016
On universal hypergraphs
Samuel Hetterich, Olaf Parczyk, Yury Person
math.CO2015
Spanning structures and universality in sparse hypergraphs
Olaf Parczyk, Yury Person
math.CO2019
2-universality in randomly perturbed graphs
Olaf Parczyk
math.CO2019
More non-bipartite forcing pairs
Tamas Hubai, Dan Kral, Olaf Parczyk +1
math.CO2019
Universality for bounded degree spanning trees in randomly perturbed graphs
Julia Böttcher, Jie Han, Yoshiharu Kohayakawa +3