Frederik Garbe I am a postdoctoral researcher at the Institute of Computer Science of the Czech Academy of Sciences working as a member of the Combinatorial Group. Previously, I held positions at Heidelberg University and Masaryk University. I received my PhD from the University of Birmingham.
Postal address: Institute of Computer Science Czech Academy of Sciences Pod Vodárenskou věží 271/2 182 00 Praha 8 Czech Republic		Contact details: Email:    garbe (at)   cs.cas.cz

Research

Publications and Preprints

• A characterization for positive semi-definite matrix products (with Fan Wei)
  Submitted.
• Hamiltonicity of inhomogeneous random graphs (with Jan Hladký and Simón Piga)
  Submitted.
• Infinitely many counterexamples to a conjecture of Lovász (with Aida Abiad, Xavier Povill, and Christoph Spiegel)
  Submitted.
• 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)
  Submitted.
• Asymptotically enumerating independent sets in regular k-partite k-uniform hypergraphs (with Patrick Arras and Felix Joos)
  Submitted.
• Hypergraphs with uniform Turán density equal to 8/27 (with Daniel Il’kovič, Daniel Král’, Filip Kučerák, and Ander Lamaison)
  Combinatorics, Probability and Computing, 35(2):280–289, 2026.
• A tower lower bound for the degree relaxation of the Regularity Lemma (with Jan Hladký)
  Combinatorial Theory, 5(4):#8, 2025.
• 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):1–14, 2025.
• 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):2878–2922, 2024.
• Hypergraphs with minimum positive uniform Turán density (with Daniel Král’ and Ander Lamaison)
  Israel Journal of Mathematics, 259(2):701–726, 2024.
• On pattern-avoiding permutons (with Jan Hladký, Gábor Kun, and Kristýna Pekárková)
  Random Structures & Algorithms, 65(1):46–60, 2024.
• Limits of Latin Squares (with Robert Hancock, Jan Hladký, and Maryam Sharifzadeh)
  Discrete Analysis, 2023:8.
• 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(4):2430–2458, 2021.
• Two remarks on graph norms (with Jan Hladký and Joonkyung Lee)
  Discrete & Computational Geometry, 67:919-929, 2022.
• Contagious sets in a degree-proportional bootstrap percolation process (with Andrew McDowell and Richard Mycroft)
  Random Structures & Algorithms, 53:638-651, 2018.
• Hamilton cycles in hypergraphs below the Dirac threshold (with Richard Mycroft)
  Journal of Combinatorial Theory, Series B, 133:153-210, 2018.
• The complexity of the Hamilton cycle problem in hypergraphs of high minimum codegree (with Richard Mycroft)
  Proceedings of the 33rd STACS, 38:1-13, 2016.
• On graphs with excess or defect 2
  J. Discrete Appl. Math. 180:81-88, 2015.

Upcoming/Recent Talks

• GRAPHS 2026, 61st Czech-Slovak Conference, Zemplínska Šírava, Slovakia, June 1–5, 2026. Talk about limit theories for dense discrete structures.
• Three Talks in Combinatorics, University of Barcelona, Barcelona, May 26, 2026. Talk about Hamiltonicity of inhomogeneous random graphs.
• LIMDA Seminar, Polytechnic University of Catalonia, Barcelona, May 21, 2026. Talk about positive semi-definite matrix products.
• G²OAT Research Seminar, Czech Technical University, Prague, December 15, 2025. Talk about infinitely many counterexamples to a conjecture of Lovász.
• Algebra and Combinatorics Seminar, Max Planck Institute for Mathematics in the Sciences, Leipzig, December 11, 2025. Talk about flip processes and dynamical systems.

Last updated: May 2026