Anton Bernshteyn

activity

20162020

most citedFree Subshifts with Invariant Measures from the Lovász Local Lemma

6 citations · 6 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2020

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

Anton Bernshteyn

We present a deterministic distributed algorithm in the LOCAL model that finds a proper $(Δ + 1)$ -edge-coloring of an $n$ -vertex graph of maximum degree $Δ$ in $\mathrm{poly}(Δ, \lo…

math.CO2019

Improved Lower Bound for Difference Bases

Anton Bernshteyn, Michael Tait

A difference basis with respect to $n$ is a subset $A \subseteq Z$ such that $A - A \supseteq {1, \dots, n}$ . Rédei and Rényi showed that the minimum size of a differen…

math.CO2018

Independent Sets in Algebraic Hypergraphs

Anton Bernshteyn, Michelle Delcourt, Anush Tserunyan

In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics…

math.CO2018

DP-Colorings of Hypergraphs

Anton Bernshteyn, Alexandr Kostochka

Classical problems in hypergraph coloring theory are to estimate the minimum number of edges, $m_{2} (r)$ (respectively, $m_{2}^{*} (r)$ ), in a non- $2$ -colorable $r$ -uniform (respective…

math.CO2016

Regular colorings and factors of regular graphs

Anton Bernshteyn, Omid Khormali, Ryan R. Martin +4

An $(r - 1, 1)$ -coloring of an $r$ -regular graph $G$ is an edge coloring such that each vertex is incident to $r - 1$ edges of one color and $1$ edge of a different color. In this paper…

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

Improved Lower Bound for Difference Bases

Independent Sets in Algebraic Hypergraphs

DP-Colorings of Hypergraphs

Regular colorings and factors of regular graphs

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