2 citations · 3 across the 7 of their papers we have counts for
10 papers
A note on unavoidable patterns in locally dense colourings
António Girão, David Munhá Correia
We show that there is a constant such that for every any -coloured with minimum degree at least in both colours contains a complete…
Pancyclicity of Hamiltonian graphs
Nemanja Draganić, David Munhá Correia, Benny Sudakov
An -vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from up to . In 1972, Erd…
Uniform Turán density of cycles
Matija Bucić, Jacob W. Cooper, Daniel Kráľ +2
In the early 1980s, Erdős and Sós initiated the study of the classical Turán problem with a uniformity condition: the uniform Turán density of a hypergraph is the infimum over…
Proof of Grinblat's conjecture on rainbow matchings in multigraphs
David Munhá Correia, Benny Sudakov
Many well-known problems in Combinatorics can be reduced to finding a large rainbow structure in a certain edge-coloured multigraph. Two celebrated examples of this are Ringel's tr…
Ramsey number of 1-subdivisions of transitive tournaments
Nemanja Draganić, David Munhá Correia, Benny Sudakov +1
The study of problems concerning subdivisions of graphs has a rich history in extremal combinatorics. Confirming a conjecture of Burr and Erdős, Alon proved in 1994 that subdivided…
Short proofs of rainbow matching results
David Munhá Correia, Alexey Pokrovskiy, Benny Sudakov
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back to the work of Euler on Latin squares and ha…
Flattening rank and its combinatorial applications
David Munhá Correia, Benny Sudakov, István Tomon
Given a -dimensional tensor (where is a field), the -flattening rank of is the rank of the matrix whose ro…
A Note on Powers of Paths in Tournaments
Nemanja Draganić, David Munhá Correia, Benny Sudakov
In this note we show that every tournament on vertices contains the -th power of a directed path of length , which improves upon the recent bound of Scott and Ko…
Powers of paths in tournaments
Nemanja Draganić, François Dross, Jacob Fox +7
In this short note we prove that every tournament contains the -th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also g…
Full rainbow matchings in equivalence relations
David Munhá Correia, Liana Yepremyan
We show that if a multigraph with maximum edge-multiplicity of at most , is edge-coloured by colours such that each colour class is a disjoint un…