2 citations · 3 across the 5 of their papers we have counts for
8 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…
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…
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…