Anton Bernshteyn

According to our database, Anton Bernshteyn authored at least 22 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Weak degeneracy of graphs.

Anton Bernshteyn, Eugene Lee

J. Graph Theory, August, 2023

Counting colorings of triangle-free graphs.

Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, Akum Kang

J. Comb. Theory, Ser. B, July, 2023

Colouring graphs with forbidden bipartite subgraphs.

James Anderson, Anton Bernshteyn, Abhishek Dhawan

Comb. Probab. Comput., January, 2023

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index.

Anton Bernshteyn, Felix Weilacher

CoRR, 2023

Borel Vizing's Theorem for Graphs of Subexponential Growth.

Anton Bernshteyn, Abhishek Dhawan

CoRR, 2023

Fast algorithms for Vizing's theorem on bounded degree graphs.

Anton Bernshteyn, Abhishek Dhawan

CoRR, 2023

2022

A fast distributed algorithm for (Δ + 1)-edge-coloring.

Anton Bernshteyn

J. Comb. Theory, Ser. B, 2022

Descriptive combinatorics and distributed algorithms.

Anton Bernshteyn

CoRR, 2022

Searching for an Intruder on Graphs and Their Subdivisions.

Anton Bernshteyn, Eugene Lee

Electron. J. Comb., 2022

2021

Coloring graphs with forbidden bipartite subgraphs.

James Anderson, Anton Bernshteyn, Abhishek Dhawan

CoRR, 2021

Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms.

Anton Bernshteyn

CoRR, 2021

2020

Fractional DP-colorings of sparse graphs.

Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu

J. Graph Theory, 2020

Regular colorings in regular graphs.

Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan, Andrew J. Uzzell

Discuss. Math. Graph Theory, 2020

A Fast Distributed Algorithm for (Δ+1)-Edge-Coloring.

Anton Bernshteyn

CoRR, 2020

2019

The Johansson-Molloy theorem for DP-coloring.

Anton Bernshteyn

Random Struct. Algorithms, 2019

DP-colorings of hypergraphs.

Anton Bernshteyn, Alexandr V. Kostochka

Eur. J. Comb., 2019

2018

Sharp Dirac's theorem for DP-critical graphs.

Anton Bernshteyn, Alexandr V. Kostochka

J. Graph Theory, 2018

2017

DP-colorings of graphs with high chromatic number.

Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu

Eur. J. Comb., 2017

The Local Cut Lemma.

Anton Bernshteyn

Eur. J. Comb., 2017

2016

On the number of edges in a graph with no (k+1)-connected subgraphs.

Anton Bernshteyn, Alexandr V. Kostochka

Discret. Math., 2016

The asymptotic behavior of the correspondence chromatic number.

Anton Bernshteyn

Discret. Math., 2016

New bounds for the acyclic chromatic index.

Anton Bernshteyn

Discret. Math., 2016