Richard Lang

Office

Room: 2/212
Phone: +49 6221 54 14324

Im Neuenheimer Feld 205
69120 Heidelberg

E-Mail: lang@informatik.uni-heidelberg.de

I am a DFG Walter Benjamin fellow in the group of Felix Joos at Heidelberg University. Before that I worked with Luke Postle at the University of Waterloo and with Allan Lo at the University of Birmingham. I received my PhD in 2017 at the Universidad de Chile under supervision of Maya Stein.

Selected publications

• with N. Sanhueza-Matamala,
  On sufficient conditions for Hamiltonicity in dense graphs.
• with L. Postle,
  An Improved Bound for the Linear Arboricity Conjecture.
• with N. Sanhueza-Matamala,
  Minimum degree conditions for tight Hamilton cycles,
  to appear in Journal of the London Mathematical Society.
  
• with C. Hoppen, Y. Kohayakawa, H. Lefmann and H. Stagni,
  Estimating parameters associated with monotone properties,
  Combinatorics, Probability and Computing (2021).
  
• with D. Korándi, S. Letzter and A. Pokrovskiy,
  Minimum degree conditions for monochromatic cycle partitioning,
  Journal of Combinatorial Theory, Series B (2020).
• with J. Corsten, L. DeBiasio and A. Lamaison,
  Upper density of monochromatic infinite paths,
  Advances in Combinatorics (2019).