Ausgewählte Publikationen (Stand: Juni 2024)

 

0


 

0

 

 

0

 

(

 

 

)

     

    0


     

    0

     

     

    0

     

    (

     

     

    )

      Fischer, Thomas; Person, Yury:
      Some results on fractional vs. expectation thresholds
      #!ilm_mods_00075723!#
      In: The electronic journal of combinatorics, vol. 32 (2025), no. 3, art. P3.39
      DOI: https://doi.org/10.37236/12611
      Espuny Díaz, Alberto; Janzer, Barnabás; Kronenberg, Gal; Lada, Joanna:
      Long running times for hypergraph bootstrap percolation
      #!ilm_mods_00006950!#
      In: European journal of combinatorics, vol. 115 (2024), art. 103783
      DOI: https://doi.org/10.1016/j.ejc.2023.103783
      Espuny Díaz, Alberto; Hyde, Joseph:
      Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
      #!ilm_mods_00007504!#
      In: European journal of combinatorics, vol. 121 (2024), art. 103848
      DOI: https://doi.org/10.1016/j.ejc.2023.103848
      Espuny Díaz, Alberto; Lichev, Lyuben; Mitsche, Dieter; Wesolek, Alexandra:
      Sharp threshold for embedding balanced spanning trees in random geometric graphs
      #!ilm_mods_00014872!#
      In: Journal of graph theory, vol. 107 (2024), no. 1, pp. 107–125
      DOI: https://doi.org/10.1002/jgt.23106
      Díaz, Alberto Espuny; Morris, Patrick; Perarnau, Guillem; Serra, Oriol:
      Speeding up random walk mixing by starting from a uniform vertex
      #!ilm_mods_00011516!#
      In: Electronic journal of probability, vol. 29 (2024), art. 26
      DOI: https://doi.org/10.1214/24-EJP1091
      Hahn-Klimroth, Max; Parczyk, Olaf; Person, Yury:
      Minimum degree conditions for containing an r-regular r-connected spanning subgraph
      #!ilm_mods_00012122!#
      In: European journal of combinatorics, vol. 118 (2024), art. 103940
      DOI: https://doi.org/10.1016/j.ejc.2024.103940
      Espuny Díaz, Alberto; Girão, António:
      Hamiltonicity of graphs perturbed by a random regular graph
      #!ilm_mods_00001433!#
      In: Random structures & algorithms, vol. 62 (2023), no. 4, pp. 857–886
      DOI: https://doi.org/10.1002/rsa.21122
      Aigner-Horev, Elad; Person, Yury:
      An asymmetric random Rado theorem: 1-statement
      #!ilm_mods_00000869!#
      In: Journal of combinatorial theory: JCTA. Series A, vol. 193 (2023), art. 105687
      DOI: https://doi.org/10.1016/j.jcta.2022.105687
      Espuny Díaz, Alberto:
      Hamiltonicity of graphs perturbed by a random geometric graph
      #!ilm_mods_00000877!#
      In: Journal of graph theory, vol. 103 (2023), no. 1, pp. 12–22
      DOI: https://doi.org/10.1002/jgt.22901
      Espuny Díaz, Alberto; Person, Yury:
      Spanning F-cycles in random graphs
      #!ilm_mods_00005540!#
      In: Combinatorics, probability & computing: CPC, vol. 32 (2023), no. 5, pp. 833–850
      DOI: https://doi.org/10.1017/S0963548323000172
      Aigner-Horev, Elad; Person, Yury:
      On sparse random combinatorial matrices
      #!ilm_mods_00000859!#
      In: Discrete mathematics, vol. 345 (2022), no. 11, art. 113017
      DOI: https://doi.org/10.1016/j.disc.2022.113017
      Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Person, Yury:
      Finding any given 2-factor in sparse pseudorandom graphs efficiently
      #!ilm_mods_00002534!#
      In: Journal of graph theory, vol. 96 (2021), no. 1, pp. 87–108
      DOI: https://doi.org/10.1002/jgt.22576
      Allen, Peter; Koch, Christoph; Parczyk, Olaf; Person, Yury:
      Finding tight Hamilton cycles in random hypergraphs faster
      #!ilm_mods_00002767!#
      In: Combinatorics, probability & computing: CPC, vol. 30 (2021), no. 2, pp. 239–257
      DOI: 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
      #!ilm_mods_00002768!#
      In: Combinatorics, probability & computing: CPC, vol. 30 (2021), no. 1, pp. 17–36
      DOI: https://doi.org/10.1017/S0963548320000346
      Condon, Padraig; Espuny Díaz, Alberto; Girão, António; Kühn, Daniela; Osthus, Deryk:
      Hamiltonicity of random subgraphs of the hypercube
      #!ilm_mods_00009137!#
      In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (ISBN 978-1-61197-646-5), (2021), pp. 889–898
      DOI: https://doi.org/10.1137/1.9781611976465.56
      Espuny Díaz, Alberto; Girão, António:
      Hamiltonicity of randomly perturbed graphs
      #!ilm_mods_00009295!#
      In: Extended abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications (ISBN 978-3-030-83822-5), (2021), pp. 38–44
      DOI: https://doi.org/10.1007/978-3-030-83823-2_7
      Espuny Díaz, Alberto; Patel, Viresh; Stroh, Fabian:
      Path decompositions of random directed graphs
      #!ilm_mods_00009298!#
      In: Extended abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications (ISBN 978-3-030-83822-5), (2021), pp. 702–706
      DOI: https://doi.org/10.1007/978-3-030-83823-2_112
      Böttcher, Julia; Montgomery, Richard; Parczyk, Olaf; Person, Yury:
      Embedding spanning bounded degree graphs in randomly perturbed graphs
      #!ilm_mods_00010309!#
      In: Mathematika : a journal of pure and applied mathematics, vol. 66 (2020), no. 2, pp. 422–447
      DOI: https://doi.org/10.1112/mtk.12005
      Clemens, Dennis; Ehrenmüller, Julia; Person, Yury:
      A Dirac-type theorem for Berge cycles in random hypergraphs
      #!ilm_mods_00011857!#
      In: The electronic journal of combinatorics, vol. 27 (2020), no. 3, art. P3.39
      DOI: https://doi.org/10.37236/8611
      Parczyk, Olaf:
      2-universality in randomly perturbed graphs
      #!ilm_mods_00001849!#
      In: European journal of combinatorics, vol. 87 (2020), art. 103118
      DOI: https://doi.org/10.1016/j.ejc.2020.103118
      Ben-Eliezer, Omri; Hefetz, Dan; Kronenberg, Gal; Parczyk, Olaf; Shikhelman, Clara; Stojaković, Miloš:
      Semi-random graph process
      #!ilm_mods_00009979!#
      In: Random structures & algorithms, vol. 56 (2020), no. 3, pp. 648–675
      DOI: https://doi.org/10.1002/rsa.20887
      Han, Jie; Kohayakawa, Yoshiharu; Morris, Patrick; Person, Yury:
      Clique-factors in sparse pseudorandom graphs
      #!ilm_mods_00012888!#
      In: European journal of combinatorics, vol. 82 (2019), art. 102999
      DOI: https://doi.org/10.1016/j.ejc.2019.102999
      Berger, Sören; Kohayakawa, Yoshiharu; Maesaka, Giulia Satiko; Martins, Taisa; Mendonça, Walner; Mota, Guilherme Oliveira; Parczyk, Olaf:
      The size-Ramsey number of powers of bounded degree trees
      #!ilm_mods_00014488!#
      In: Acta mathematica Universitatis Comenianae, vol. 88 (2019), no. 3, pp. 451–456
      [EUROCOMB, European Conference on Combinatorics, Graph Theory and Applications (Bratislava, 26.-30.08.2019)]
      URL: https://ezb.ur.de/?2012428-4
      Parczyk, Olaf:
      Almost spanning universality in random graphs
      #!ilm_mods_00014489!#
      In: Acta mathematica Universitatis Comenianae, vol. 88 (2019), no. 3, pp. 997–1002
      [EUROCOMB, European Conference on Combinatorics, Graph Theory and Applications (Bratislava, 26.-30.08.2019)]
      URL: https://ezb.ur.de/?2012428-4
      Hubai, Tamás; Král’, Daniel; Parczyk, Olaf; Person, Yury:
      More non-bipartite forcing pairs
      #!ilm_mods_00014490!#
      In: Acta mathematica Universitatis Comenianae, vol. 88 (2019), no. 3, pp. 819–825
      [EUROCOMB, European Conference on Combinatorics, Graph Theory and Applications (Bratislava, 26.-30.08.2019)]
      URL: https://ezb.ur.de/?2012428-4
      Barros, Gil F.; Cavalar, Bruno P.; Mota, Guilherme Oliveira; Parczyk, Olaf:
      Anti-Ramsey threshold of cycles for sparse graphs
      #!ilm_mods_00015378!#
      In: Electronic notes in theoretical computer science: ENTCS, vol. 346 (2019), pp. 89–98
      [10. Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS) (Belo Horizonte, 02.-07.06.2019)]
      DOI: https://doi.org/10.1016/j.entcs.2019.08.009
      Böttcher, Julia; Han, Jie; Kohayakawa, Yoshiharu; Montgomery, Richard; Parczyk, Olaf; Person, Yury:
      Universality for bounded degree spanning trees in randomly perturbed graphs
      #!ilm_mods_00012147!#
      In: Random structures & algorithms, vol. 55 (2019), no. 4, pp. 854–864
      DOI: https://doi.org/10.1002/rsa.20850
      Aigner-Horev, Elad; Person, Yury:
      Monochromatic Schur triples in randomly perturbed dense sets of integers
      #!ilm_mods_00011815!#
      In: SIAM journal on discrete mathematics, vol. 33 (2019), no. 4, pp. 2175–2180
      DOI: https://doi.org/10.1137/18M1227007
      Han, Jie; Kohayakawa, Yoshiharu; Person, Yury:
      Near-perfect clique-factors in sparse pseudorandom graphs
      #!ilm_mods_00018092!#
      In: Electronic notes in discrete mathematics, vol. 68 (2018), pp. 221–226
      [11. Discrete Mathematics Days (Sevilla, 27.-29.06.2018)]
      DOI: https://doi.org/10.1016/j.endm.2018.06.038
      Cooley, Oliver; Kang, Mihyun; Person, Yury:
      Largest components in random hypergraphs
      #!ilm_mods_00002770!#
      In: Combinatorics, probability & computing: CPC, vol. 27 (2018), no. 5, pp. 741–762
      DOI: https://doi.org/10.1017/S096354831800010X
      Aigner-Horev, Elad; Conlon, David; Hạ̀n, Hiêp; Person, Yury; Schacht, Mathias:
      Quasirandomness in hypergraphs
      #!ilm_mods_00015078!#
      In: The electronic journal of combinatorics, vol. 25 (2018), no. 3, art. P3.34
      DOI: https://doi.org/10.37236/7537
      Özkahya, Lale; Person, Yury:
      Minimum rainbow H-decompositions of graphs
      #!ilm_mods_00015094!#
      In: European journal of combinatorics, vol. 81 (2018), pp. 111–124
      DOI: https://doi.org/10.1016/j.ejc.2018.03.002