63 citations · 247 across the 29 of their papers we have counts for
44 papers
Measurable matchings in unbalanced graphs
Anton Bernshteyn, Matt Bowen, Felix Weilacher
Let be a locally finite multigraph that is bipartite and "unbalanced," meaning that it has a nontrivial bipartition with for all $x…
On strongly and robustly critical graphs
Anton Bernshteyn, Hemanshu Kaul, Jeffrey A. Mudrock +1
In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list-critical graphs occupy a promin…
Weak Degeneracy of Planar Graphs
Anton Bernshteyn, Eugene Lee, Evelyne Smith-Roberge
The weak degeneracy of a graph is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for g…
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
Anton Bernshteyn, Felix Weilacher
Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical not…
DP-Coloring of Graphs from Random Covers
Anton Bernshteyn, Daniel Dominik, Hemanshu Kaul +1
DP-coloring (also called correspondence coloring) of graphs is a generalization of list coloring that has been widely studied since its introduction by Dvořák and Postle in .…
Borel Vizing's Theorem for Graphs of Subexponential Growth
Anton Bernshteyn, Abhishek Dhawan
We show that every Borel graph of subexponential growth has a Borel proper edge-coloring with colors. We deduce this from a stronger result, namely that an -verte…