32 citations · 98 across the 35 of their papers we have counts for
5 papers · 1 filter
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…
A proof of Ringel's Conjecture
Richard Montgomery, Alexey Pokrovskiy, Benny Sudakov
A typical decomposition question asks whether the edges of some graph can be partitioned into disjoint copies of another graph . One of the oldest and best known conjectures…