Biography
Michael Yatauro earned a B.A. in mathematics from Rutgers University, an M.A. in mathematics from the University of Pennsylvania, and a Ph.D. in mathematics from Stevens Institute of Technology. Dr. Yatauro views mathematics as a form of artistic expression and a scientific tool of great utility. His primary research is in the field of graph theory. In particular, he is interested in determining structural aspects of a graph by studying its degree sequence. Much of his work has focused on results concerning the toughness and binding number of a graph, the study of which lies at the heart of questions concerning significant aspects of graph theory (hamiltonicity, factors, cycle structure, etc.).
He also enjoys playing the drums and is using mathematics and AI tools to study the timing of drummers.
Recent Publications and Presentations
M. Yatauro. 2-factors in 1-tough, k-connected graphs with prescribed independence number. The 10th biennial Canadian Discrete and Algorithmic Mathematics Conference, University of Ottawa, Ottawa, Ontario, Canada, May 2025.
J. Bazaar and M. Yatauro. The gathering number of a graph and vertex degrees. Combinatorics, Graph Theory and Computing. SEICCGTC 2023. Springer Proceedings in Mathematics & Statistics, vol 489 (2025), 89 - 94.
M. Yatauro. Component order edge connectivity, vertex degrees, and integer partitions, Theory Appl. Graphs. Vol. 12: Iss. 1, Article 1 (2025).
M. Yatauro. Parameterized binding numbers and degree sequence theorems. Discrete Math. Lett. 12 (2023), 225 - 232.
M. Yatauro. Degree sequence theorems for measures of connectivity. SIAM Conference on Discrete Mathematics, Carnegie Mellon University, Pittsburgh, PA, June 2022.