David Munhá Correia
David Munhá Correia
Hi! I am a fourth 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
20. N. Draganić, R. Montgomery, D. Munhá Correia, A. Pokrovskiy and B. Sudakov; Hamiltonicity of expanders: optimal bounds and applications, submitted.
19. J.T. Hsieh, P. Kothari, S Mohanty, D. Munhá Correia, B. Sudakov; Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs, submitted.
18. N. Draganić, S. Glock, D. Munhá Correia and B. Sudakov; Optimal Hamilton covers and linear arboricity for random graphs, submitted.
17. N. Draganić, M. Kaufmann, D. Munhá Correia, K. Petrova and R. Steiner; Size-Ramsey numbers of structurally sparse graphs, submitted.
16. N. Draganić, D. Munhá Correia, A. Methuku and B. Sudakov; Cycles with many chords, to appear in Random Structures and Algorithms.
15. S. Glock, D. Munhá Correia and B. Sudakov; Hamilton cycles in pseudorandom graphs, submitted.
14. N. Draganić, D. Munhá Correia and B. Sudakov; A generalization of Bondy's pancyclicity theorem, to appear in Combinatorics, Probability and Computing.
13. N. Draganić, D. Munhá Correia and B. Sudakov; Chvátal-Erdős condition for pancyclicity, to appear in Journal of the Association for Mathematical Research.
12. X. Liu, D. Mubayi and D. Munhá Correia; Turán problems in pseudorandom graphs, submitted.
11. A. Girão and D. Munhá Correia; A note on unavoidable patterns in locally dense colourings, to appear in Combinatorics, Probability and Computing.
10. N. Draganić, D. Munhá Correia and B. Sudakov; Pancyclicity of Hamiltonian graphs, to appear in Journal of European Mathematical Society.
9. M. Bucić, J. W. Cooper, D. Král', S. Mohr and D. Munhá Correia; Uniform Turán density of cycles, accepted in Transactions of AMS.
8. S. Glock, D. Munhá Correia and B. Sudakov; The n-queens completion problem, Research in the Mathematical Sciences 9 (2022).
7. N. Draganić, D. Munhá Correia, B. Sudakov and R. Yuster; Ramsey number of 1-subdivisions of transitive tournaments, J. Combinatorial Theory Ser. B 157 (2022) 176–183.
6. D. Munhá Correia and B. Sudakov; Proof of Grinblat's conjecture on rainbow matchings in multigraphs, accepted to Israel Journal of Mathematics.
5. D. Munhá Correia, A. Pokrovskiy and B. Sudakov; Short proofs of rainbow matching results, Int. Math. Res. Not. (IMRN), to appear.
4. N. Draganić, D. Munhá Correia and B. Sudakov; Tight bounds for powers of Hamilton cycles in tournaments, Journal of Combinatorial Theory, ser. B 158: 305-340.
3. D. Munhá Correia, I. Tomon and 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, Combinatorics, Probability and Computing 30: 894-898.
1. D. Munhá Correia, L. Yepremyan; - Full rainbow matchings in equivalence relations.