Always fair, encouraging, and motivating.
Robert E. L. Aldred is an Emeritus Professor in the Department of Mathematics and Statistics at the University of Otago. He earned his MSc and PhD from the University of Melbourne and holds the FTICA designation. Aldred joined the University of Otago in 1989, was promoted to full Professor in 2011, and retired from active duties in April 2021, subsequently being awarded Emeritus status. During his tenure, he served as Head of the Department of Mathematics and Statistics.
Aldred's research specializes in graph theory and combinatorics, focusing on matching extension, extendability, and criticality in graphs; perfect matchings in graphs on surfaces including planar, projective planar, torus, and Klein bottle; distance-restricted matching extension; cycles in highly connected graphs such as 5-connected triangulations; forbidden subgraphs and 2-factors; prism graphs, quadrangulations, and punctured planar triangulations; symmetric graphs, regular graphs, and edge-connectivity conditions; matroid theory and graphic codes; permutation patterns, monotonic sequence games, and sorting classes; Latin squares, graceful/harmonious labelings of trees; pancyclicity, hypohamiltonian graphs, and linear k-arboricity. He has produced 52 publications, garnering 584 citations. Key publications include "Edge proximity conditions for extendability in regular bipartite graphs" (2023), "Removal of subgraphs and perfect matchings in graphs on surfaces" (2022), "Distance Matching Extension in Cubic Bipartite Graphs" (2021), "Extendability and Criticality in Matching Theory" (2020), "Restricted matching in plane triangulations and near triangulations" (2020), "Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane" (2020), and "Cycles in 5-connected triangulations" (2019).
