research
∙
10/26/2022
Turán graphs with bounded matching number
We determine the maximum possible number of edges of a graph with n vert...
share
research
∙
09/16/2020
Typical and Extremal Aspects of Friends-and-Strangers Graphs
Given graphs X and Y with vertex sets V(X) and V(Y) of the same cardinal...
research
∙
01/31/2020
Boosting Simple Learners
We consider boosting algorithms under the restriction that the weak lear...
research
∙
08/10/2019
High-girth near-Ramanujan graphs with localized eigenvectors
We show that for every prime d and α∈ (0,1/6), there is an infinite sequ...
research
∙
12/23/2018
The hat guessing number of graphs
Consider the following hat guessing game: n players are placed on n vert...
research
∙
08/07/2017
