|
1. |
Lang, Richard: Monochromatic cycle partitions in random graphs / Richard Lang and Allan Lo, 2021. - 17 S. In: Combinatorics, probability & computing, ISSN 1469-2163. 30(2021), 1, Seite 136-152 DOI: 10.1017/S0963548320000401
![Online resource](/https/katalog.ub.uni-heidelberg.de/opacicon/silk/page_world.png) Online resource ![Journal article](/https/katalog.ub.uni-heidelberg.de/opacicon/zs_artikel.png) Journal article
|
|
|
2. |
Glock, Stefan: Counting Hamilton cycles in Dirac hypergraphs / Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn and Deryk Osthus, 2021. - 23 S. In: Combinatorics, probability & computing, ISSN 1469-2163. 30(2021), 4, Seite 631-653 DOI: 10.1017/S0963548320000619
![Online resource](/https/katalog.ub.uni-heidelberg.de/opacicon/silk/page_world.png) Online resource ![Journal article](/https/katalog.ub.uni-heidelberg.de/opacicon/zs_artikel.png) Journal article
|
|
|
3. |
Draganić, Nemanja: Powers of paths in tournaments / Nemanja Draganić, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William … , 23 March 2021. - 5 S. In: Combinatorics, probability & computing, ISSN 1469-2163. 30(2021), 6 vom: Nov., Seite 894-898 DOI: 10.1017/S0963548321000067
![Online resource](/https/katalog.ub.uni-heidelberg.de/opacicon/silk/page_world.png) Online resource ![Journal article](/https/katalog.ub.uni-heidelberg.de/opacicon/zs_artikel.png) Journal article
|
|
|
4. |
Ehard, Stefan: Pseudorandom hypergraph matchings / Stefan Ehard, Stefan Glock and Felix Joos, 22 July 2020. - 18 S. In: Combinatorics, probability & computing, ISSN 1469-2163. 29(2020), 6, Seite 868-885 DOI: 10.1017/S0963548320000280
![Online resource](/https/katalog.ub.uni-heidelberg.de/opacicon/silk/page_world.png) Online resource ![Journal article](/https/katalog.ub.uni-heidelberg.de/opacicon/zs_artikel.png) Journal article
|
|
|
|