Theo Molla's Homepage

Theo Molla

Assistant Professor
Department of Mathematics and Statistics - University of South Florida
Office: CMC 326A
Email: molla@usf.edu
URL: http://myweb.usf.edu/~molla

General Information

I am an assistant professor in the Math and Statistics Department of The University of South Florida. My research is in Graph Theory. I focus on extremal graph theory and probabilistic methods. I received my PhD from Arizona State University in August of 2013. My PhD advisors were H.A Kierstead and A. Czygrinow.

CV

Curriculum Vitae

Research

Transversal C_k-factors in subgraphs of the balanced blow-up of C_k Combinatorics, Probability and Computing (2022 31(6)) with B. Ergemlidze.
Disjoint cycles in graphs with restricted independence number Discrete Applied Mathematics (2022 30) with M. Santana
Powers of Hamiltonian cycles in multipartite graphs Discrete Mathematics (2022 345(4)) with L. DeBiasio and R. Martin.
On even rainbow or nontriangular directed cycles Journal of Combinatorics (2021 12(4)) with A. Czygrinow, B. Nagle, and R. Oursler.
Transitive tournament tilings in oriented graphs with large minimum total degree SIAM Journal on Discrete Mathematics (2021 35(1)) with L. DeBiasio, A. Lo, and A. Treglown.
On odd rainbow cycles in edge-colored graphs European Journal of Combinatorics (May 2021) with A. Czygrinow, B. Nagle, and R. Oursler.
Disjoint cycles and chorded cycles in a graph with given minimum degree Discrete Mathematics (2020) with M. Santana and E. Yeager.
Cyclic triangle factors in regular tournaments The Electronic Journal of Combinatorics (2019) with L. Li.
Long rainbow cycles and Hamiltonian cycles using many colors in properly edge-colored complete graphs European Journal of Combinatorics (2019) with J. Balogh
An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles Optimization Problems in Graph Theory (2018) (book chapter) with H.A. Kierstead, A. Kostochka and D. Yager.
Triangle-tilings in graphs without large independent sets Combinatorics, Probability and Computing (2018) with J. Balogh, A. McDowell and R. Mycroft.
Tiling directed graphs with tournaments Forum of Mathematics, Sigma, (2018) with A. Czygrinow, L. DeBiasio and A. Treglown.
Sharpening an Ore-type version of the Corrádi-Hajnal theorem Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (2017) with H.A. Kierstead, A. Kostochka, and E. Yeager.
Spanning trees with leaf distance at least d Discrete Math (2017) with C. Erbes, S. Mousley, and M. Santana.
Transitive Triangle Tilings in Oriented Graphs, Journal of Combinatorial Theory, Series B (2017) with J. Balogh and A. Lo.
A refinement of theorems on vertex disjoint chorded cycles Graphs and Combinatorics (2017) with M. Santana and E. Yeager.
Triangle factors of graphs without large independent sets and of weighted graphs Random Structures & Algorithms (2016) with J. Balogh and M. Sharifzadeh (Appendix by C. Reiher and M. Schacht).
Increasing paths in edge-ordered graphs: the hypercube and random graphs, Electronic Journal of Combinatorics (2016) with J. De Silva, F. Pfender, T. Retter and M. Tait.
Arbitrary Orientations of Hamilton Cycles in Digraphs, SIAM J. Discrete Math. (2015) with L. DeBiasio, D. Kühn, D. Osthus and A. Taylor.
The semi-degree threshold for anti-directed Hamilton cycles, Electronic Journal of Combinatorics (2015) with L. DeBiasio.
An extension of the Hajnal-Szemerédi theorem to directed graphs, Combinatorics, Probability and Computing (2015) 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) with A. Czygrinow.
On directed versions of the Corrádi-Hajnal Corollary, European Journal of Combinatorics (2014) with A. Czygrinow and H.A. Kierstead.
A note on relaxed equitable coloring of graphs, Information Processing Letters (2011) with H. Fan, H.A. Kierstead, G. Liu, J. Wu and X. Zhang.

Teaching

University of South Florida

MAD 4202 Optimization - Fall 2020
MAD 4203 Introduction to Combinatorics - Fall 2020
MAD 6207 Combinatorics II - Spring 2020
MAD 4301 Introduction to Graph Theory - Spring 2020
MAD 6206 Combinatorics I - Fall 2019
MAD 4203 Introduction to Combinatorics - Fall 2019
MAD 4301 Introduction to Graph Theory - Spring 2019
MAD 4203 Introduction to Combinatorics - Fall 2018
MAC 2312 Calculus II - Fall 2018
MAD 4301 Introduction to Graph Theory - Spring 2018
MAD 4203 Introduction to Combinatorics - Fall 2017

University of Illinois at Urbana-Champaign

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