Anton Bernshteyn

activity

20142026

most citedThe asymptotic behavior of the correspondence chromatic number

63 citations · 247 across the 29 of their papers we have counts for

collaborators

Showing 2021Show all

7 papers · 1 filter

math.CO2021

Weak degeneracy of graphs

Anton Bernshteyn, Eugene Lee

Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, which we call weak degeneracy. By definition, every $d$ -degenerate graph is also…

math.CO2021★ 1 cited

Counting colorings of triangle-free graphs

Anton Bernshteyn, Tyler Brazelton, Ruijia Cao +1

By a theorem of Johansson, every triangle-free graph $G$ of maximum degree $Δ$ has chromatic number at most $(C + o (1)) Δ/ lo g Δ$ for some universal constant $C > 0$ . Using the entrop…

math.CO2021★ 4 cited

Coloring graphs with forbidden bipartite subgraphs

James Anderson, Anton Bernshteyn, Abhishek Dhawan

A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph $F$ , there is a constant $c_{F} > 0$ such that if $G$ is an $F$ -free graph of maximum degree $Δ$ , then $χ(G)…

math.DS2021

Equivariant maps to subshifts whose points have small stabilizers

Anton Bernshteyn

Let $Γ$ be a countably infinite group. Given $k \in N$ , we use $Free (k^{Γ})$ to denote the free part of the Bernoulli shift action of $Γ$ on $k^{Γ}$ . Seward and Tucke…

math.CO2021

Borel fractional colorings of Schreier graphs

Anton Bernshteyn

Let $Γ$ be a countable group and let $G$ be the Schreier graph of the free part of the Bernoulli shift of $Γ$ (with respect to some finite subset $F \subseteq Γ$ ). We show that the…

math.CO2021

Searching for an Intruder on Graphs and Their Subdivisions

Anton Bernshteyn, Eugene Lee

In this paper we analyze a variant of the pursuit-evasion game on a graph $G$ where the intruder occupies a vertex, is allowed to move to adjacent vertices or remain in place, and…