4 citations · 9 across the 5 of their papers we have counts for
23 papers
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…
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…
Isomorphic Bisections of Cubic Graphs
Shagnik Das, Alexey Pokrovskiy, Benny Sudakov
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have…
Rota's Basis Conjecture holds asymptotically
Alexey Pokrovskiy
Rota's Basis Conjecture is a well known problem from matroid theory, that states that for any collection of bases in a rank matroid, it is possible to decompose all the ele…
New bounds for Ryser's conjecture and related problems
Peter Keevash, Alexey Pokrovskiy, Benny Sudakov +1
A Latin square of order is an array filled with symbols such that each symbol appears only once in every row or column and a transversal is a collection of cel…
C4-free subgraphs with large average degree
Richard Montgomery, Alexey Pokrovskiy, Benny Sudakov
Motivated by a longstanding conjecture of Thomassen, we study how large the average degree of a graph needs to be to imply that it contains a -free subgraph with average degre…