3 papers
math.CO2026
Borel Local Lemma: arbitrary random variables and limited exponential growth
Anton Bernshteyn, Jing Yu
The Lovász Local Lemma (the LLL for short) is a powerful tool in probabilistic combinatorics that is used to verify the existence of combinatorial objects with desirable propertie…
math.CO2025
Embedding Borel graphs into grids of asymptotically optimal dimension
Anton Bernshteyn, Jing Yu
Let be a Borel graph all of whose finite subgraphs embed into the -dimensional grid with diagonals. We show that then itself admits a Borel embedding into the Schreier g…
cs.DS2025
A linear-time algorithm for -edge-coloring
Anton Bernshteyn, Abhishek Dhawan
We present a randomized algorithm that, given a constant , outputs a proper -edge-coloring of an -edge simple graph of maximum degree in $O(m)…