Norman J. Pullman (1931 – 1995) was an American mathematician who made significant contributions to combinatorial mathematics, particularly in graph theory and the enumeration of combinatorial structures. He served as a professor of mathematics at the University of Texas at Austin, where he conducted research and taught graduate and undergraduate courses.
Academic career
Pullman earned his doctoral degree in mathematics in the mid‑1950s, after which he joined the faculty of the University of Texas at Austin. During his tenure, he supervised numerous graduate students and collaborated with other researchers in the field of discrete mathematics.
Research contributions
Pullman's work focused on the enumeration of trees, graphs, and related combinatorial objects. He authored and co‑authored a number of papers that addressed problems such as counting labeled and unlabeled trees, studying extremal properties of graphs, and developing methods for combinatorial enumeration. His publications appeared in reputable journals of mathematics and combinatorics.
Publications and collaborations
Among his notable contributions are papers co‑authored with other prominent combinatorialists, including Frank Harary and Richard R. Hall. Pullman's research has been cited in subsequent studies on graph enumeration, network reliability, and the design of combinatorial algorithms.
Legacy
Norman J. Pullman's research helped advance the theoretical foundations of graph theory and combinatorial enumeration. His work continues to be referenced in the literature of discrete mathematics, and his influence persists through the students he mentored and the collaborations he fostered.