Anton Bernshteyn

activity

20232026

collaborators

Showing math.LOShow all

2 papers · 1 filter

math.LO2026

Randomized Borel $(2 d + 1)$ -coloring of digraphs

Anton Bernshteyn, Edward Hou, Forte Shinko +1

Let $G$ be a Borel digraph with maximum out-degree $d \in N$ . We show that $G$ admits a random Borel $(2 d + 1)$ -coloring for which every edge is almost surely not monochroma…

math.LO2023

Borel line graphs

James Anderson, Anton Bernshteyn

We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the 9 finite graphs from the classical result of Beineke together with a 10th infinite graph as…

Randomized Borel (2d+1)-coloring of digraphs

Borel line graphs

Randomized Borel $(2 d + 1)$ -coloring of digraphs