Anton Bernshteyn

From MaRDI portal
Person:294560

Available identifiers

zbMath Open bernshteyn.antonMaRDI QIDQ294560

List of research outcomes





PublicationDate of PublicationType
Borel Vizing's theorem for graphs of subexponential growth2024-12-18Paper
Borel line graphs2023-10-11Paper
Weak degeneracy of graphs2023-10-10Paper
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index2023-08-28Paper
DP-Coloring of Graphs from Random Covers2023-08-25Paper
Borel Vizing's Theorem for Graphs of Subexponential Growth2023-06-30Paper
Distributed algorithms, the Lovász local lemma, and descriptive combinatorics2023-06-28Paper
Borel fractional colorings of Schreier graphs2023-06-20Paper
Counting colorings of triangle-free graphs2023-05-02Paper
Equivariant maps to subshifts whose points have small stabilizers2023-04-26Paper
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms2023-02-16Paper
Large-scale geometry of Borel graphs of polynomial growth2023-02-09Paper
Descriptive Combinatorics and Distributed Algorithms2023-01-16Paper
Searching for an intruder on graphs and their subdivisions2022-07-04Paper
Independent sets in algebraic hypergraphs2022-03-29Paper
Coloring graphs with forbidden almost bipartite subgraphs2022-03-14Paper
Local coloring problems on smooth graphs2022-02-11Paper
On Baire measurable colorings of group actions2022-01-10Paper
Equitable colourings of Borel graphs2021-12-06Paper
A fast distributed algorithm for \((\Delta+1)\)-edge-coloring2021-11-17Paper
Coloring graphs with forbidden bipartite subgraphs2021-07-12Paper
Equivariant maps to subshifts whose points have small stabilizers2021-06-17Paper
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms2021-02-17Paper
Local Coloring Problems on Smooth Graphs2020-12-20Paper
A short proof of Bernoulli disjointness via the local lemma2020-10-29Paper
Fractional DP‐colorings of sparse graphs2020-05-21Paper
Regular colorings in regular graphs2020-04-28Paper
Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem2020-03-04Paper
Building large free subshifts using the Local Lemma2020-01-22Paper
Multiplication of weak equivalence classes may be discontinuous2019-11-14Paper
Improved lower bound for difference bases2019-09-05Paper
Measurable versions of the Lovász local lemma and measurable graph colorings2019-08-20Paper
The Johansson‐Molloy theorem for DP‐coloring2019-08-14Paper
DP-colorings of hypergraphs2019-06-18Paper
A short nonalgorithmic proof of the containers theorem for hypergraphs2019-02-12Paper
Sharp Dirac's theorem for DP‐critical graphs2018-08-16Paper
Building Large Free Subshifts Using the Local Lemma2018-02-20Paper
DP-colorings of graphs with high chromatic number2017-08-31Paper
On Baire Measurable Colorings of Group Actions2017-08-31Paper
On DP-coloring of graphs and multigraphs2017-06-30Paper
The local cut lemma2017-06-19Paper
On differences between DP-coloring and list coloring2017-05-13Paper
Free Subshifts with Invariant Measures from the Lov\'asz Local Lemma2017-02-09Paper
The asymptotic behavior of the correspondence chromatic number2016-07-05Paper
New bounds for the acyclic chromatic index2016-06-16Paper
Regular colorings and factors of regular graphs2016-03-30Paper
On the number of edges in a graph with no \((k + 1)\)-connected subgraphs2015-12-08Paper
The Local Action Lemma2014-10-06Paper
Fast algorithms for Vizing's theorem on bounded degree graphsN/APaper

Research outcomes over time

This page was built for person: Anton Bernshteyn