Department of Mathematics - University of Illinois at Urbana-Champaign

Office: Illini Hall 226

Email: molla@illinois.edu

URL: https://faculty.math.illinois.edu/~molla

- Triangle-tilings in graphs without large independent sets (submitted) (with J. Balogh, A. McDowell and R. Mycroft)
- Tiling directed graphs with tournaments (submitted) (with A. Czygrinow, L. DeBiasio and A. Treglown)
- Triangle factors of graphs without large independent sets and of weighted graphs (accepted by Random Structures and Algorithms) (with J. Balogh and M. Sharifzadeh and Appendix by C. Reiher and M. Schacht).
- Arbitrary Orientations of Hamilton Cycles in Digraphs, SIAM J. Discrete Math. (2015) 1553--1584 (with L. DeBiasio, D. Kühn, D. Osthus and A. Taylor)
- Increasing paths in edge-ordered graphs: the hypercube and random graphs, Electronic Journal of Combinatorics (2016) 23 2.15 (with J. De Silva, F. Pfender, T. Retter and M. Tait)
- Transitive Triangle Tilings in Oriented Graphs, (accepted by Journal of Combinatorial Theory, Series B) (with J. Balogh and A. Lo)
- The semi-degree threshold for anti-directed Hamilton cycles, Electronic Journal of Combinatorics (2015) 22 4.34 (with L. DeBiasio)
- An extension of the Hajnal-Szemerédi theorem to directed graphs, Combinatorics, Probability and Computing (September 2015) 754--773 (with A. Czygrinow, L. DeBiasio and H.A. Kierstead)
- Tight co-degree condition for the existence of loose Hamilton cycles in 3-graphs, SIAM J. Discrete Math. (2014) 67-76 (with A. Czygrinow) arxiv
- On directed versions of the Corrádi-Hajnal Corollary, European Journal of Combinatorics (November 2014). 1-14. (with A. Czygrinow and H.A. Kierstead)
- Sharpening an Ore-type version of the Corrádi-Hajnal theorem (published by Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (with H.A. Kierstead, A. Kostochka, and E. Yeager)
- Spanning trees with leaf distance at least D (accepted by Discrete Math) (with C. Erbes, S. Mousley, and M. Santana)
- A refinement of theorems on vertex disjoint chorded cycles Graphs and Combinatorics (January 2017) 181-201 (with M. Santana and E. Yeager)
- A note on relaxed equitable coloring of graphs, Information Processing Letters (2011) 1062-1066. (with H. Fan, H.A. Kierstead, G. Liu, J. Wu and X. Zhang)

- University of Illinois at Urbana-Champaign
- Math 484 Nonlinear Programming - Spring 2017
- Math 482 Linear Programming - Fall 2016
- Math 482 Linear Programming - Spring 2016
- Math 412 Graph Theory - Spring 2016
- Math 482 Linear Programming - Fall 2015
- Math 588 Optimization in Networks - Spring 2015
- Math 482 Linear Programming - Spring 2015
- Math 484 Nonlinear Programming - Fall 2014
- Math 482 Linear Programming - Spring 2014
- Math 412 Graph Theory - Spring 2014
- Math 115 Preparation for Calculus - Fall 2013
- Arizona State University
- MAT 416/MAT 513 Graph Theory (Assistant) - Spring 2013
- APM 503/MAT 570 Applied Analysis (Assistant) - Fall 2012
- MAT 514 Enumerative Combinatorics (Assitant) - Fall 2011
- MAT 266 Calculus for Engineers II - Summer 2011
- MAT 514 Enumerative Combinatorics (Assistant) - Fall 2010
- MAT 265 Calculus for Engineers I - Spring 2010
- MAT 271 Calculus w/ Analytic Geometry II (Recitation) - Fall 2009
- MAT 271 Calculus w/ Analytic Geometry II (Recitation) - Spring 2009
- MAT 271 Calculus w/ Analytic Geometry II (Recitation) - Fall 2008