Richard Lang
I am a Ramón y Cajal researcher in the GAPCOMB group at the Polytechnic University of Catalonia. My research takes place in extremal and probabilistic combinatorics with a particular focus on embedding problems, (hyper)graph decompositions and Ramsey theory.
I am a Ramón y Cajal researcher in the GAPCOMB group at the Polytechnic University of Catalonia. My research takes place in extremal and probabilistic combinatorics with a particular focus on embedding problems, (hyper)graph decompositions and Ramsey theory.
Selected works
Selected works
With N. Sanhueza-Matamala,
On sufficient conditions for spanning structures in dense graphs,
Proceedings of the London Mathematical Society (2023), 83 pages.With L. Postle,
An Improved Bound for the Linear Arboricity Conjecture,
Combinatorica (2023), 22 pages.With N. Sanhueza-Matamala,
Minimum degree conditions for tight Hamilton cycles,
Journal of the London Mathematical Society (2022), 75 pages.With D. Korándi, S. Letzter and A. Pokrovskiy,
Minimum degree conditions for monochromatic cycle partitioning,
Journal of Combinatorial Theory, Series B (2021), 27 pages.With J. Corsten, L. DeBiasio and A. Lamaison,
Upper density of monochromatic infinite paths,
Advances in Combinatorics (2019), 16 pages.
Contact
Contact
richard.lang@upc.edu
