I agree that this site is using cookies. You can find further informations here.
X
Correia, David Munhá
42  results:
Search for persons X
?
1

Tight Bounds for Powers of Hamilton Cycles in Tournaments:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,
Draganić, Nemanja ; Correia, David Munhá ; Sudakov, Benny - p. 521-526 , 2021
Link: https://doi.org/10.1007/..
 
?
2

Powers of paths in tournaments:

Draganić, Nemanja ; Dross, François ; Fox, Jacob...
Combinatorics, Probability and Computing.  30 (2021)  6 - p. 894-898 , 2021
Link: https://doi.org/10.1017/..
 
?
3

A generalization of Bondy's pancyclicity theorem:

Draganić, Nemanja ; Munhá Correia, David ; Sudakov, Benny
Combinatorics, Probability and Computing.  , 2024
Link: https://doi.org/10.1017/..
 
?
4

Cycles with many chords:

Draganić, Nemanja ; Methuku, Abhishek ; Munhá Correia, David.
Random Structures & Algorithms.  65 (2024)  1 - p. 3-16 , 2024
Link: https://doi.org/10.1002/..
 
?
5

Turán problems in pseudorandom graphs:

Liu, Xizhi ; Mubayi, Dhruv ; Munhá Correia, David
Combinatorics, Probability and Computing.  , 2024
Link: https://doi.org/10.1017/..
 
?
6

Tight bounds for powers of Hamilton cycles in tournaments:

Draganić, Nemanja ; Munhá Correia, David ; Sudakov, Benny
Journal of Combinatorial Theory, Series B.  158 (2023)  - p. 305-340 , 2023
Link: https://doi.org/10.1016/..
 
?
7

Ramsey number of 1-subdivisions of transitive tournaments:

Draganić, Nemanja ; Munhá Correia, David ; Sudakov, Benny.
Journal of Combinatorial Theory, Series B.  157 (2022)  - p. 176-183 , 2022
Link: https://doi.org/10.1016/..
 
?
8

The n-queens completion problem:

Glock, Stefan ; Munhá Correia, David ; Sudakov, Benny
Research in the Mathematical Sciences.  9 (2022)  3 - p. , 2022
Link: https://doi.org/10.1007/..
 
?
9

Flattening rank and its combinatorial applications:

Munhá Correia, David ; Sudakov, Benny ; Tomon, István
Linear Algebra and its Applications.  625 (2021)  - p. 113-125 , 2021
Link: https://doi.org/10.1016/..
 
?
10

Small Even Covers, Locally Decodable Codes and Restricted S..:

Hsieh, Jun-Ting ; Kothari, Pravesh K ; Mohanty, Sidhanth..
http://arxiv.org/abs/2401.11590.  , 2024
Link: http://arxiv.org/abs/240..
 
?
11

Optimal Hamilton covers and linear arboricity for random gr..:

Draganić, Nemanja ; Glock, Stefan ; Correia, David Munhá.
http://arxiv.org/abs/2310.11580.  , 2023
Link: http://arxiv.org/abs/231..
 
?
12

Cycles with many chords:

Draganić, Nemanja ; Methuku, Abhishek ; Correia, David Munhá.
http://arxiv.org/abs/2306.09157.  , 2023
Link: http://arxiv.org/abs/230..
 
?
13

Chv\'atal-Erd\H{o}s condition for pancyclicity:

Draganić, Nemanja ; Correia, David Munhá ; Sudakov, Benny
http://arxiv.org/abs/2301.10190.  , 2023
Link: http://arxiv.org/abs/230..
 
?
14

Hamilton cycles in pseudorandom graphs:

Glock, Stefan ; Correia, David Munhá ; Sudakov, Benny
http://arxiv.org/abs/2303.05356.  , 2023
Link: http://arxiv.org/abs/230..
 
?
15

Size-Ramsey numbers of structurally sparse graphs:

Draganić, Nemanja ; Kaufmann, Marc ; Correia, David Munhá..
http://arxiv.org/abs/2307.12028.  , 2023
Link: http://arxiv.org/abs/230..
 
1-15