Felix Joos
Office
Room: 2/209
Phone: +49 6221 54 14322
Im Neuenheimer Feld 205
69120 Heidelberg
Selected Publications:
- F. Joos, M. Kühn and B. Schülke, Decomposing hypergraphs into cycle factors.
- S. Ehard and F. Joos, Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree.
- S. Glock, F. Joos, J. Kim, D. Kühn, and D. Osthus, Resolution of the Oberwolfach problem, to appear in J. Eur. Math. Soc.
- M. Jenssen, F. Joos, and W. Perkins, On kissing numbers and spherical codes in high dimensions, Adv. Math. 335 (2018), 307-321.
- H. Bruhn, M. Heinlein and F. Joos, Long cycles have the edge-Erdös-Pósa property, Combinatorica 39 (2019), 1-36.
- T. Huynh, F. Joos, and P. Wollan, A unified Erdös-Pósa theorem for constrained cycles, Combinatorica 39 (2019), 91-133.
- F. Joos, J. Kim, D. Kühn, and D. Osthus, Optimal packings of bounded degree trees, J. Eur. Math. Soc. 21 (2019), 3573-3647.
- F. Joos, G. Perarnau, D. Rautenbach, and B. Reed, How to determine if a random graph with a fixed degree sequence has a giant component, Probab. Theory Related Fields 170 (2018), 263--310 (an extended abstract appeared in FOCS 2016, 695--703).