We stand with Ukraine  

Anton Bernshteyn

Orcid: 0000-0001-8070-3408

According to our database1, Anton Bernshteyn authored at least 24 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sunflowers in set systems with small VC-dimension.
[BibTeX]
[DOI]
József Balogh
,
Anton Bernshteyn
,
Michelle Delcourt
,
Asaf Ferber
,
Huy Tuan Pham
CoRR, 2024

A linear-time algorithm for (1+ε)Δ-edge-coloring.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Abhishek Dhawan
CoRR, 2024

2023
Weak degeneracy of graphs.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Eugene Lee
J. Graph Theory, August, 2023

Counting colorings of triangle-free graphs.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Tyler Brazelton
,
Ruijia Cao
,
Akum Kang
J. Comb. Theory B, July, 2023

Colouring graphs with forbidden bipartite subgraphs.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Felix Weilacher
CoRR, 2023

Borel Vizing's Theorem for Graphs of Subexponential Growth.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Abhishek Dhawan
CoRR, 2023

Fast algorithms for Vizing's theorem on bounded degree graphs.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Abhishek Dhawan
CoRR, 2023

2022
A fast distributed algorithm for (Δ + 1)-edge-coloring.
[BibTeX]
[DOI]
Anton Bernshteyn
J. Comb. Theory B, 2022

Descriptive combinatorics and distributed algorithms.
[BibTeX]
[DOI]
Anton Bernshteyn
CoRR, 2022

Searching for an Intruder on Graphs and Their Subdivisions.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Eugene Lee
Electron. J. Comb., 2022

2021
Coloring graphs with forbidden bipartite subgraphs.
[BibTeX]
[DOI]
James Anderson
,
Anton Bernshteyn
,
Abhishek Dhawan
CoRR, 2021

Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms.
[BibTeX]
[DOI]
Anton Bernshteyn
CoRR, 2021

2020
Fractional DP-colorings of sparse graphs.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Alexandr V. Kostochka
,
Xuding Zhu
J. Graph Theory, 2020

Regular colorings in regular graphs.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Anton Bernshteyn
CoRR, 2020

2019
The Johansson-Molloy theorem for DP-coloring.
[BibTeX]
[DOI]
Anton Bernshteyn
Random Struct. Algorithms, 2019

DP-colorings of hypergraphs.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Alexandr V. Kostochka
Eur. J. Comb., 2019

2018
Sharp Dirac's theorem for DP-critical graphs.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Alexandr V. Kostochka
J. Graph Theory, 2018

2017
DP-colorings of graphs with high chromatic number.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Alexandr V. Kostochka
,
Xuding Zhu
Eur. J. Comb., 2017

The Local Cut Lemma.
[BibTeX]
[DOI]
Anton Bernshteyn
Eur. J. Comb., 2017

2016
On the number of edges in a graph with no (k+1)-connected subgraphs.
[BibTeX]
[DOI]
Anton Bernshteyn
,
Alexandr V. Kostochka
Discret. Math., 2016

The asymptotic behavior of the correspondence chromatic number.
[BibTeX]
[DOI]
Anton Bernshteyn
Discret. Math., 2016

New bounds for the acyclic chromatic index.
[BibTeX]
[DOI]
Anton Bernshteyn
Discret. Math., 2016


  Loading...