Theoretical Computer Science & Discrete Mathematics

Frederik Garbe

Frederik is a postdoc in the Theoretical Computer Science and Discrete Mathematics research group at the University of Heidelberg. His research mostly concerns extremal problems in graphs and hypergraphs as well as limit theories for discrete structures.

Office

Room: 2/212
Im Neuenheimer Feld 205
69120 Heidelberg
Phone: +49 6221 54 14324
Email: garbe (at) informatik.uni-heidelberg.de

Publications

Graph factors and powers of Hamilton cycles in the budget-constrained random graph process (with Alberto Espuny Díaz, Tássio Naia, and Zak Smith)
Preprint.

Asymptotically enumerating independent sets in regular k-partite k-uniform hypergraphs (with Patrick Arras, and Felix Joos)
Preprint.

A tower lower bound for the degree relaxation of the Regularity Lemma (with Jan Hladký)
Preprint.

Hypergraphs with uniform Turán density equal to 8/27 (with Daniel Iľkovič, Daniel Král', Filip Kučerák, and Ander Lamaison)
Preprint.

The dimension of the feasible region of pattern densities (with Daniel Král', Alexandru Malekshahian, and Raul Penaguiao)
Mathematical Proceedings of the Cambridge Philosophical Society 178:1 (2025): 1-14. Extended abstract appeared in the Proceedings of EUROCOMB'23.

From flip processes to dynamical systems on graphons (with Jan Hladký, Matas Šileikis, and Fiona Skerman)
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 60:4 (2024): 2878-2922.

On pattern-avoiding permutons (with Jan Hladký, Gabor Kun, and Kristýna Perkárková)
Random Structures & Algorithms, 65:1 (2024), 46–60.

Hypergraphs with minimum positive uniform Turán density (with Daniel Král' and Ander Lamaison)
Israel Journal of Mathematics, 259:2 (2024), 701–726. Extended abstract appeared in the Proceedings of EUROCOMB'21.

Limits of Latin Squares (with Robert Hancock, Jan Hladký, and Maryam Sharifzadeh)
Discrete Analysis, 2023:8, 66pp. Extended abstract appeared in the Proceedings of EUROCOMB'19.

Two remarks on graph norms (with Jan Hladký and Joonkyung Lee)
Discrete & Computational Geometry, 67 (2022), 919-929.

Longest paths in random hypergraphs (with Oliver Cooley, Eng Keat Hng, Mihyun Kang, Nicolás Sanhueza-Matamala, and Julian Zalla)
SIAM Journal on Discrete Mathematics, 35 (2021), 2430-2458.

Contagious sets in a degree-proportional bootstrap percolation process (with Andrew McDowell and Richard Mycroft)
Random Structures & Algorithms, 53 (2018), 638-651.

Hamilton cycles in hypergraphs below the Dirac threshold (with Richard Mycroft)
Journal of Combinatorial Theory, Series B, 133 (2018), 153-210.

The complexity of the Hamilton cycle problem in hypergraphs of high minimum codegree (with Richard Mycroft)
Proceedings of the 33rd STACS (2016), 38:1-13.

On graphs with excess or defect 2
J. Discrete Appl. Math. 180 (2015), 81-88.

Last update on Mar 7, 2025 at 12:38 UTC