Wikipedia

Paul A. Catlin

(Redirected from Paul Catlin)

Paul Allen Catlin ((1948-06-25)June 25, 1948 – (1995-04-20)April 20, 1995) was a mathematician, professor of mathematics who worked in graph theory and number theory. He wrote a significant paper on the series of chromatic numbers and Brooks' theorem, titled Hajós graph coloring conjecture: variations and counterexamples.[1][2][3]

Paul Allen Catlin
Born(1948-06-25)June 25, 1948
DiedApril 20, 1995(1995-04-20) (aged 46)
Alma materOhio State University
Known forGraph theory
Number theory
Scientific career
FieldsMathematics
Thesis Embedding subgraphs and coloring graphs under extremal degree conditions  (1976)
Doctoral advisorG. Neil Robertson

Career

edit

Originally from Bridgeport, Connecticut, Catlin majored in Mathematics with a B.A. degree from Carnegie Mellon University in 1970.[1]

Catlin held a Doctorate in Mathematics degree from Ohio State University. From 1972 to 1973, he was a research and teaching assistant at Ohio State University, where he earned the Master of Science degree in Mathematics.[1]

In 1976, he went to work at Wayne State University, where he concentrated the research on chromatic numbers and Brooks' theorem. As a result, Catlin published a significant paper in that series: Hajós graph coloring conjecture: variations and counterexamples.,[1][4] which showed that the conjecture raised by Hugo Hadwiger is further strengthened not only by   but also by  , which led to the joint paper written with Paul Erdős and Béla Bollobás titled Hadwiger's conjecture is true for almost every graph.[5]

He authored over fifty academic papers in number theory and graph theory. Many of his contributions and collaborations have been published in The Fibonacci Quarterly, in The Journal of Number Theory, in the Journal of Discrete Mathematics, and many other academic publications.[3] He co-authored scholarly papers with Arthur M. Hobbs,[6] Béla Bollobás and Paul Erdős,[5] Hong-Jian Lai, Zheng-Yiao Han, and Yehong Shao,[6] among others. He also published papers with G. Neil Robertson, with whom he also completed his dissertation thesis in 1976.[1][7]


Selected publications

edit

References

edit
  1. ^ a b c d e Hobbs, Arthur M.; Lai, Hong-Jian; Robertson, Neil (2001). "Paul Catlin 1948–1995" (PDF). Discrete Mathematics. 230 (1–3): 3–12. doi:10.1016/s0012-365x(00)00065-0; Preface pp. 3–6,{{cite journal}}: CS1 maint: postscript (link) Publication list for Paul Catlin, math.wvu.edu Archived 2017-08-09 at the Wayback Machine
  2. ^ "List of publications of Paul A. Catlin". Leibniz Center for Informatics.
  3. ^ a b "Publications of Paul A. Catlin" (PDF). West Virginia University. Archived from the original on 2017-08-09. Retrieved 2012-10-25.
  4. ^ Paul A. Catlin (1979). "Hajós' graph-coloring conjecture: Variations and counterexamples" (PDF). Journal of Combinatorial Theory. 26 (2): 268–274. doi:10.1016/0095-8956(79)90062-5.
  5. ^ a b Paul A. Catlin; Béla Bollobás; Paul Erdős (1980). "Hadwiger's conjecture is true for almost every graph". European Journal of Combinatorics. 1 (3): 195. doi:10.1016/s0195-6698(80)80001-1.
  6. ^ a b "Coauthor index". Leibniz Center for Informatics.
  7. ^ Catlin, Paul A (1976). Embedding subgraphs and coloring graphs under extremal degree conditions (PDF) (Ph.D.). Ohio State University.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Paul_A._Catlin&oldid=1222487733"