I have been a member of Seton Hall University's Department of Mathematics and Computer Science since 2005. Before that I received my Ph.D. and M.S. in Mathematics from Stevens Institute of Technology, and my M.A.T. (Masters of Arts in Teaching) and B.S. degrees from Duke University. In between attending those two institutions, I also spent a few years as a research analyst for an educational research firm.
My primary research area is graph theory, sometimes called network theory, and most recently I have been studying the degree sequences of graphs and their relationship to various graph parameters like edge-connectivity and toughness, as well as when a graph's degree sequence implies that it has certain types of subgraphs. I have also written on network reliability, Tutte (or barrier) sets in graphs, and matching theory. Two students, Laura Gruca and Florian Buchegger, and I just completed a project on the card game "Rat-a-Tat-Cat."
Professor Kahl is also the Mathematics and Computer Science Club advisor.
- Ph.D., Stevens Institute of Technology
- M.S., Stevens Institute of Technology
- B.S., Duke University
- "Graphs with the Maximum or Minimum Number of 1-Factors", Discrete Mathematics, February 2010
- "Degree Conditions and Toughness", Joint Mathematics Meetings, San Francisco, California, January 2010
- "Sufficient Degree Conditions for k-Edge-Connectedness of a Graph", Networks, 54(2), September 2009
- "Best Monotone Degree Conditions and Bounds", 2nd Canadian Discrete and Algorithmic Mathematics Conference, Montreal, Canada, May 2009
- Organizing a Special Session on Graph Theory for the Spring 2010 AMS Eastern Section Meeting in Newark, New Jersey (May 2010)
- University Research Council Award, 2009, Seton Hall University