Dr. Jaromy Kuhl

• Position: UWF Provost, Professor
• Department: Mathematics and Statistics
• Office Location: Building 4, Room 426
• jkuhl@uwf.edu
• Campus: 850.473.7702

Biography

Dr. Jaromy Kuhl is the UWF Provost and a Professor in the Department of Mathematics and Statistics. Kuhl’s research focuses on combinatorics, especially graph theory. He studies Latin squares and bipartite graphs, coloring graphs, extremal problems, Hamiltonicity (or longest cycles in a graph) and the Tutte polynomial.

His findings have been published in Graphs and Combinatorics, Annals of Combinatorics, Australasian Journal of Combinatorics, Discrete Applied Mathematics, and other peer-reviewed journals. They covered such topics as blocks of non-empty cells, longest transversals in k-protoplexes, avoiding partial Latin squares and complete multipartite graphs. In addition, he has made presentations at academic conferences in China, Australia and elsewhere.

He joined UWF in 2005 after earning four degrees from the University of Mississippi: Ph.D. in Mathematics, Graph Theory; M.S. in Mathematics; and two B.S. degrees, one in Mathematics and one in Physics. Kuhl has taught numerous graduate and undergraduate courses in mathematics and statistics. As department head, he teaches, conducts research, participates in committees and manages department schedules and activities, and oversees budgets, grants and other matters.

Degrees & Institutions

BS Mathematics - University of Mississippi
BA Physics - University of Mississippi
MS Mathematics - University of Mississippi
PhD Mathematics - University of Mississippi

Research

Combinatorics: Design Theory and Graph Theory. Major Interests: Bipartite Graphs and Latin Squares, Hamiltonicity and Longest Cycles, Tutte Polynomial, Graph Colorings, Competition Numbers, and Graph Decompositions.

Keywords: combinatorics, graph theory, latin squares, bipartite graphs, coloring graphs, extremal problems, Hamiltonicity, Tutte polynomial, blocks of non-empty cells, transversals in k-protoplexes, avoiding partial latin squares, complete multipartite graphs