Ausgewählte Publikationen (Stand: April 2021)

Publications

Anzahl der Treffer: 29
Erstellt: Wed, 27 Mar 2024 23:22:34 +0100 in 0.0850 sec


Espuny Díaz, Alberto; Patel, Viresh; Stroh, Fabian
Path decompositions of random directed graphs. - In: Extended abstracts EuroComb 2021, (2021), S. 702-706

In this work we consider extensions of a conjecture due to Alspach, Mason, and Pullman from 1976. This conjecture concerns edge decompositions of tournaments into as few paths as possible. There is a natural lower bound for the number paths needed in an edge decomposition of a directed graph in terms of its degree sequence; the conjecture in question states that this bound is correct for tournaments of even order. The conjecture was recently resolved for large tournaments, and here we investigate to what extent the conjecture holds for directed graphs in general. In particular, we prove that the conjecture holds with high probability for the random directed graph Dn,pDn,pD_{n,p} for a large range of p.



Allen, Peter; Koch, Christoph; Parczyk, Olaf; Person, Yury
Finding tight Hamilton cycles in random hypergraphs faster. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 30 (2021), 2, S. 239-257

https://doi.org/10.1017/S0963548320000450
Condon, Padraig; Espuny Díaz, Alberto; Girão, António; Kühn, Daniela; Osthus, Deryk
Dirac's theorem for random regular graphs. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 30 (2021), 1, S. 17-36

https://doi.org/10.1017/S0963548320000346
Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Person, Yury
Finding any given 2-factor in sparse pseudorandom graphs efficiently. - In: Journal of graph theory, ISSN 1097-0118, Bd. 96 (2021), 1, S. 87-108

https://doi.org/10.1002/jgt.22576
Clemens, Dennis; Ehrenmüller, Julia; Person, Yury
A Dirac-type theorem for Berge cycles in random hypergraphs. - In: The electronic journal of combinatorics, ISSN 1077-8926, Volume 27 (2020), issue 3, P3.39, Seite 1-23

https://doi.org/10.37236/8611
Parczyk, Olaf;
2-universality in randomly perturbed graphs. - In: European journal of combinatorics, Bd. 87 (2020), 103118

https://doi.org/10.1016/j.ejc.2020.103118
Böttcher, Julia; Montgomery, Richard; Parczyk, Olaf; Person, Yury
Embedding spanning bounded degree graphs in randomly perturbed graphs. - In: Mathematika, ISSN 2041-7942, Bd. 66 (2020), 2, S. 422-447

https://doi.org/10.1112/mtk.12005
Ben-Eliezer, Omri; Hefetz, Dan; Kronenberg, Gal; Parczyk, Olaf; Shikhelman, Clara; Stojakoviâc, Miloš
Semi-random graph process. - In: Random structures & algorithms, ISSN 1098-2418, Bd. 56 (2020), 3, S. 648-675

https://doi.org/10.1002/rsa.20887
Barros, Gil F.; Cavalar, Bruno P.; Mota, Guilherme Oliveira; Parczyk, Olaf
Anti-Ramsey threshold of cycles for sparse graphs. - In: Electronic notes in theoretical computer science, ISSN 1571-0661, Bd. 346 (2019), S. 89-98

https://doi.org/10.1016/j.entcs.2019.08.009
Berger, Sören; Kohayakawa, Yoshiharu; Maesaka, Giulia Satiko; Martins, Taisa; Mendon¸ca, Walner; Mota, Guilherme Oliveira; Parczyk, Olaf
The size-Ramsey number of powers of bounded degree trees. - In: Acta mathematica Universitatis Comenianae, ISSN 0862-9544, Bd. 88 (2019), 3, S. 451-456