Anton Bernshteyn

From MaRDI portal
Person:294560

Available identifiers

zbMath Open bernshteyn.antonMaRDI QIDQ294560

List of research outcomes

PublicationDate of PublicationType
Weak degeneracy of graphs2023-10-10Paper
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
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
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
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
DP-colorings of graphs with high chromatic number2017-08-31Paper
On DP-coloring of graphs and multigraphs2017-06-30Paper
The local cut lemma2017-06-19Paper
The asymptotic behavior of the correspondence chromatic number2016-07-05Paper
New bounds for the acyclic chromatic index2016-06-16Paper
On the number of edges in a graph with no \((k + 1)\)-connected subgraphs2015-12-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Anton Bernshteyn