The following pages link to Anton Bernshteyn (Q294560):
Displaying 33 items.
- New bounds for the acyclic chromatic index (Q294561) (← links)
- On the number of edges in a graph with no \((k + 1)\)-connected subgraphs (Q898127) (← links)
- Independent sets in algebraic hypergraphs (Q2119362) (← links)
- Searching for an intruder on graphs and their subdivisions (Q2153405) (← links)
- Regular colorings in regular graphs (Q2175238) (← links)
- Building large free subshifts using the Local Lemma (Q2286357) (← links)
- Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem (Q2303689) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Improved lower bound for difference bases (Q2322896) (← links)
- The local cut lemma (Q2357223) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
- DP-colorings of graphs with high chromatic number (Q2400975) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- The asymptotic behavior of the correspondence chromatic number (Q2629278) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms (Q2684542) (← links)
- Equivariant maps to subshifts whose points have small stabilizers (Q2699496) (← links)
- Sharp Dirac's theorem for DP‐critical graphs (Q4581280) (← links)
- A short nonalgorithmic proof of the containers theorem for hypergraphs (Q4621383) (← links)
- Equitable colourings of Borel graphs (Q5014071) (← links)
- On Baire measurable colorings of group actions (Q5019557) (← links)
- Local coloring problems on smooth graphs (Q5029036) (← links)
- Descriptive Combinatorics and Distributed Algorithms (Q5059747) (← links)
- Fractional DP‐colorings of sparse graphs (Q5110652) (← links)
- A short proof of Bernoulli disjointness via the local lemma (Q5130866) (← links)
- The Johansson‐Molloy theorem for DP‐coloring (Q5229335) (← links)
- Multiplication of weak equivalence classes may be discontinuous (Q5243098) (← links)
- Counting colorings of triangle-free graphs (Q6038582) (← links)
- Weak degeneracy of graphs (Q6047953) (← links)
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
- Borel fractional colorings of Schreier graphs (Q6159728) (← links)
- On Baire Measurable Colorings of Group Actions (Q6290743) (← links)
- Local Coloring Problems on Smooth Graphs (Q6356557) (← links)
