32 citations · 98 across the 35 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021★ 1 cited
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…
math.CO2021★ 4 cited
Size-Ramsey numbers of powers of hypergraph trees and long subdivisions
Shoham Letzter, Alexey Pokrovskiy, Liana Yepremyan
The -colour size-Ramsey number of a hypergraph is the minimum number of edges in a hypergraph whose every -edge-colouring contains a monochromatic copy of . We sho…