David Munhá Correia
David Munhá Correia
Hi! I am a first year PhD student of Benny Sudakov at ETH Zürich. Previously, I did an MMath at the University of Oxford.
My research interests broadly lie in the areas of extremal and probabilistic combinatorics.
My email address is david dot munhacanascorreia at math dot ethz dot ch.
Papers
7. N. Draganić, D. Munhá Correia, B. Sudakov; Ramsey number of 1-subdivisions of transitive tournaments, submitted.
6. D. Munhá Correia, B. Sudakov; Proof of Grinblat's conjecture on rainbow matchings in multigraphs, submitted.
5. D. Munhá Correia, A. Pokrovskiy, B. Sudakov; Short proofs of rainbow matching results, submitted.
4. N. Draganić, D. Munhá Correia, B. Sudakov; Tight bounds for powers of Hamilton cycles in tournaments, submitted.
3. D. Munhá Correia, I. Tomon, B. Sudakov; Flattening rank and its combinatorial applications, Linear Algebra and its Application 625 (2021), 113-125.
2. N. Draganić, F. Dross, J. Fox, A. Girão, F. Havet, D. Korándi, W. Lochet, D. Munhá Correia, A. Scott and B. Sudakov. (2020). Powers of paths in tournaments, accepted in Combinatorics, Probability and Computing.
1. D. Munhá Correia, L. Yepremyan; - Full rainbow matchings in equivalence relations.