Improved lower bounds on the number of edges in list critical and online list critical graphs, submitted (with L. Rabern).

 

On the Chromatic Number of Exact Distance and Weak Distance Graphs, J. of Combin. Theory B to appear (with J. van den Heuvel and D. Quiroz).

 

A sharp Dirac-Erd\H{o}s type bound for large graphs, Combinatorics, Probability and Computing to appear (with A.R. McConvey and A.V. Kostochka).

 

From a magic card trick to Hall’s theorem, in: Inspiring Mathematics: Lessons from the Navajo Nation Math Circles, MSRI Math Circles Library book series, D. Auckly, T. Shubin et. al. (eds) (2016), submitted (with Matthias Kawski).

 

An algorithmic answer to the Ore-type version of Dirac’s question on disjoint cycles, Springer Optimization and Its Applications: Graphs’ Optimization Problems and Their Computational Complexities, to appear (with A. V. Kostochka, T. Molla, and D. Yager).

 

An easy subexponential bound for online chain partitioning, submitted (with B. Bosek, T. Krawczyk, G. Matecki, and Matthew E. Smith).