Faculty

Institution

Unit

Venue

Anton Bernshteyn

Assistant Professor

Georgia Institute of Technology

Affiliations

College of Sciences

School of Mathematics

Anton Bernshteyn is currently serving as a College Of Sciences Assistant Professor at Georgia Institute of Technology.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Anton Bernshteyn

Georgia Institute of Technology

Assistant Professor

You can click a keyword to filter the displayed items

graph theory applied mathematics mathematics combinatorics combinatorial theory discrete mathematics discrete algorithms extremal graph theory combinatorial optimization theoretical computer science structural graph theory algebraic graph theory hypergraph theory computer science dynamical systems mathematical sciences topological graph theory graph minors high chromatic number lovasz local lemma local lemma theory of computation topology geometry mathematical programming polyhedron fractional calculus colorimetry analytic combinatorics algebraic combinatorics extremal combinatorics geometric graph theory combinatorial problems combinatorial methods lower bounds graph analysis analytic number theory theoretical analysis applied algebra discontinuity correspondence chromatic number asymptotic behavior johansson-molloy theorem list coloring sharp dirac critical graphs minimum number local cut lemma measurable versions measurable graph colorings fractional dp‐colorings fractional chromatic number math xmlns set theory graph coloring combinatory analysis ergodic theory descriptive set theory

Notable Scholarly Works

Notable Federal Grants

Collaborators

Counting Colorings of Triangle-Free Graphs. Journal of Combinatorial Theory Series B (2023)

Anton BernshteynTyler BrazeltonRuijia CaoAkum Kang

graph theorycombinatoricscombinatorial theory

Distributed Algorithms, the LováSz Local Lemma, and Descriptive Combinatorics. Inventiones mathematicae (2023)

Anton Bernshteyn

descriptive combinatoricscombinatoricsmathematicslovasz local lemma

Equivariant Maps to Subshifts Whose Points Have Small Stabilizers. Journal of Modern Dynamics (2023)

Anton Bernshteyn

small stabilizersequivariant mapsdynamical systems

Probabilistic Constructions in Continuous Combinatorics and a Bridge to Distributed Algorithms. Advances in Mathematics (2023)

Anton Bernshteyn

combinatoricscontinuous combinatoricsprobabilistic constructionsapplied mathematicsmathematics

Weak Degeneracy of Graphs. Journal of Graph Theory (2023)

Anton BernshteynEugene Lee

graph theoryweak degeneracyapplied mathematics

Borel Fractional Colorings of Schreier Graphs. Annales Henri Lebesgue (2022)

Anton Bernshteyn

graph theoryborel fractional coloringsapplied mathematicsfractional calculusschreier graphs

Colouring Graphs With Forbidden Bipartite Subgraphs. Combinatorics Probability Computing (2022)

James AndersonAnton BernshteynAbhishek Dhawan

graph theorycombinatoricsforbidden bipartite subgraphs

Searching for an Intruder on Graphs and Their Subdivisions. The Electronic Journal of Combinatorics (2022)

Anton BernshteynEugene Lee

combinatoricsextremal graph theorygraph theorygraph analysisapplied mathematics

A Fast Distributed Algorithm for (Δ + 1)-Edge-Coloring. Journal of Combinatorial Theory Series B (2021)

Anton Bernshteyn

combinatorial methodsfast distributed algorithmcombinatoricscombinatorial theorycombinatorial optimizationapplied mathematics

Equitable Colourings of Borel Graphs. Forum of Mathematics Pi (2021)

Anton BernshteynClinton T. Conley

combinatoricsgraph theoryborel graphsnumber theoryapplied mathematicsequitable colourings

1
2
3
4
10 / page

Anton Bernshteyn

Assistant Professor

Georgia Institute of Technology

Affiliations

College of Sciences

School of Mathematics

Anton Bernshteyn is currently serving as a College Of Sciences Assistant Professor at Georgia Institute of Technology.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Anton Bernshteyn

Georgia Institute of Technology

Assistant Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Counting Colorings of Triangle-Free Graphs. Journal of Combinatorial Theory Series B (2023)

Anton BernshteynTyler BrazeltonRuijia CaoAkum Kang

graph theorycombinatoricscombinatorial theory

Distributed Algorithms, the LováSz Local Lemma, and Descriptive Combinatorics. Inventiones mathematicae (2023)

Anton Bernshteyn

descriptive combinatoricscombinatoricsmathematicslovasz local lemma

Equivariant Maps to Subshifts Whose Points Have Small Stabilizers. Journal of Modern Dynamics (2023)

Anton Bernshteyn

small stabilizersequivariant mapsdynamical systems

Probabilistic Constructions in Continuous Combinatorics and a Bridge to Distributed Algorithms. Advances in Mathematics (2023)

Anton Bernshteyn

combinatoricscontinuous combinatoricsprobabilistic constructionsapplied mathematicsmathematics

Weak Degeneracy of Graphs. Journal of Graph Theory (2023)

Anton BernshteynEugene Lee

graph theoryweak degeneracyapplied mathematics

Borel Fractional Colorings of Schreier Graphs. Annales Henri Lebesgue (2022)

Anton Bernshteyn

graph theoryborel fractional coloringsapplied mathematicsfractional calculusschreier graphs

Colouring Graphs With Forbidden Bipartite Subgraphs. Combinatorics Probability Computing (2022)

James AndersonAnton BernshteynAbhishek Dhawan

graph theorycombinatoricsforbidden bipartite subgraphs

Searching for an Intruder on Graphs and Their Subdivisions. The Electronic Journal of Combinatorics (2022)

Anton BernshteynEugene Lee

combinatoricsextremal graph theorygraph theorygraph analysisapplied mathematics

A Fast Distributed Algorithm for (Δ + 1)-Edge-Coloring. Journal of Combinatorial Theory Series B (2021)

Anton Bernshteyn

combinatorial methodsfast distributed algorithmcombinatoricscombinatorial theorycombinatorial optimizationapplied mathematics

Equitable Colourings of Borel Graphs. Forum of Mathematics Pi (2021)

Anton BernshteynClinton T. Conley

combinatoricsgraph theoryborel graphsnumber theoryapplied mathematicsequitable colourings

1
2
3
4
10 / page

Similar Faculty Members

Tom Kelly

Institution

Georgia Institute of Technology

discrete algorithm

combinatorial problem

Patrick Bennett

Institution

Western Michigan University

discrete algorithm

combinatorics

Brendan T. Nagle

Institution

University of South Florida

hypergraph theory

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Michael Tait

Institution

Villanova University

graph theory

applied mathematics

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra

Gregory L. McColm

Institution

University of South Florida

mathematical logic

mathematics education

Andrzej Dudek

Institution

Western Michigan University

probability theory

combinatorial problem

Similar Faculty Members

Tom Kelly

Institution

Georgia Institute of Technology

discrete algorithm

combinatorial problem

Patrick Bennett

Institution

Western Michigan University

discrete algorithm

combinatorics

Brendan T. Nagle

Institution

University of South Florida

hypergraph theory

combinatorics

Theodore Molla

Institution

University of South Florida

discrete algorithm

probabilistic graph theory

Bernard Lidický

Institution

Iowa State University

discrete algorithm

extremal graph theory

Ryan Martin

Institution

Iowa State University

extremal graph theory

extremal poset theory

Michael Tait

Institution

Villanova University

graph theory

applied mathematics

Jason McCullough

Institution

Iowa State University

algebra

commutative algebra

Gregory L. McColm

Institution

University of South Florida

mathematical logic

mathematics education

Andrzej Dudek

Institution

Western Michigan University

probability theory

combinatorial problem