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