63 citations · 247 across the 29 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 10 cited
New Bounds for the Acyclic Chromatic Index
Anton Bernshteyn
An edge coloring of a graph is called an acyclic edge coloring if it is proper and every cycle in contains edges of at least three different colors. The least number of col…
math.CO2014★ 4 cited
The Local Action Lemma
Anton Bernshteyn
The Lovász Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser…