Jump to content

Paul A. Catlin: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
 
(21 intermediate revisions by 12 users not shown)
Line 1: Line 1:
{{short description|American mathematician}}
{{primary sources|date=September 2021}}
{{Infobox scientist
{{Infobox scientist
| name = Paul Allen Catlin
| name = Paul Allen Catlin
Line 37: Line 39:
}}
}}


'''Paul Allen Catlin''' ({{birth date|1948|6|25}} – {{Date of death|1995|4|20}}) was a mathematician, professor of mathematics and Doctor of Mathematics, known for his valuable contributions to [[graph theory]] and [[number theory]]. He wrote one of the most cited papers in the series of chromatic numbers and Brooks' theorem, entitled '' Hajós graph coloring conjecture: variations and counterexamples''.<ref name=catlin>{{cite journal |last1=Hobbs |first1=Arthur M. |author1-link=Arthur Hobbs (mathematician)|last2= Lai |first2= Hong-Jian |last3= Robertson |first3= Neil |authorlink3=Neil Robertson (mathematician) |title= Paul Catlin 1948–1995 |chapter= Preface |journal= Discrete Mathematics |year=2001 |volume= 230 |issue=1-3 |pages= 3–12 |url= http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/ListPublicationsCatlin.htm |doi=10.1016/s0012-365x(00)00065-0}}</ref><ref>{{cite web |url= http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/c/Catlin:Paul_A=.html |title= List of publications of Paul A. Catlin |work= [[Dagstuhl|Leibniz Center for Informatics]] }}</ref><ref name=list>{{cite web |url=http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/ListPublicationsCatlin.htm |title=Publications of Paul A. Catlin |work=West Virginia University }}</ref>
'''Paul Allen Catlin''' ({{birth date|1948|6|25}} – {{Date of death|1995|4|20}}) 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''.<ref name=catlin>{{cite journal |last1= Hobbs |first1= Arthur M. |author1-link= Arthur Hobbs (mathematician) |last2= Lai |first2= Hong-Jian |last3= Robertson |first3= Neil |authorlink3= Neil Robertson (mathematician) |title= Paul Catlin 1948–1995 |postscript= ; Preface pp. 3–6, |journal= Discrete Mathematics |year= 2001 |volume= 230 |issue= 1–3 |pages= 3–12 |url= http://www.math.wvu.edu/~hjlai/Pdf/Paul_Catlin.pdf |doi= 10.1016/s0012-365x(00)00065-0 |doi-access= free }} [http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/ListPublicationsCatlin.htm Publication list for Paul Catlin, math.wvu.edu] {{Webarchive|url=https://web.archive.org/web/20170809125550/http://www.math.wvu.edu/~hjlai/Pdf//Paul_Catlin.pdf |date=2017-08-09 }}</ref><ref>{{cite web |url= http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/c/Catlin:Paul_A=.html |title= List of publications of Paul A. Catlin |work= [[Dagstuhl|Leibniz Center for Informatics]] }}</ref><ref name=list>{{cite web |url=http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/ListPublicationsCatlin.htm |title=Publications of Paul A. Catlin |work=West Virginia University |access-date=2012-10-25 |archive-url=https://web.archive.org/web/20170809125550/http://www.math.wvu.edu/~hjlai/Pdf//Paul_Catlin.pdf |archive-date=2017-08-09 |url-status=dead }}</ref>


==Career==
==Career==


Originally from [[Bridgeport]], [[Connecticut]], Catlin majored in Mathematics with a B.A. degree from [[Carnegie Mellon University]] in 1970.<ref name=catlin/>
⚫
He held a Doctorate in Mathematics degree from [[Ohio State University]], authored over fifty academic papers in [[number theory]] and [[graph theory]]. Many of his contributions and collaborations have been published in ''[[Fibonacci Quarterly|The Fibonacci Quarterly]]'', in ''[[Journal of Number Theory|The Journal of Number Theory]]'', in the ''Journal of [[Discrete Mathematics (journal)|Discrete Mathematics]]'', and many other academic publications.<ref name=list/> He co-authored scholarly papers with Arthur M. Hobbs,<ref name=coauthors>{{cite web |url= http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/c/Catlin:Paul_A=.html#coauthors |title= Coauthor index |work = Leibniz Center for Informatics }}</ref> [[Béla Bollobás]] and [[Paul Erdős]],<ref name=hadwiger>{{cite journal
⚫
|author= Paul A. Catlin
⚫
|author2 = Béla Bollobás
⚫
|author3 = Paul Erdős
⚫
|title = Hadwiger’s conjecture is true for almost every graph
⚫
|journal= European Journal of Combinatorics
⚫
|year= 1980
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin18.pdf
⚫
}}</ref> [[Hong-Jian Lai]], Zheng-Yiao Han, and Yehong Shao,<ref name=coauthors/> among others. He also published papers with [[Neil Robertson (mathematician)|G. Neil Robertson]], with whom he also completed his dissertation thesis in 1976.<ref name=catlin/><ref>{{cite thesis |type=Ph.D. |first=Paul A |last=Catlin |title=Embedding subgraphs and coloring graphs under extremal degree conditions |publisher=Ohio State University |year=1976 |url=http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Dissertation_1.pdf }}</ref>


Originally from [[Bridgeport]], [[Connecticut]], he majored in Mathematics with a B.A. degree from [[Carnegie Mellon University]] in 1970.<ref name=catlin/>
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.<ref name=catlin/>


⚫
In 1976, he went to work at [[Wayne State University]], where he concentrated the research on [[Graph coloring#Definition and terminology|chromatic numbers]] and [[Brooks' theorem]]. As a result, Catlin published a significant paper in that series: ''Hajós graph coloring conjecture: variations and counterexamples.'',<ref name=catlin/><ref>{{cite journal
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.<ref name=catlin/>

⚫
In 1976, he went to work at [[Wayne State University]], where he concentrated the research on [[Graph_coloring#Definition_and_terminology|chromatic numbers]] and [[Brooks' theorem]]. As a result, '''Paul A. Catlin''' published one of the most cited papers in that series: ''Hajós graph coloring conjecture: variations and counterexamples.'',<ref name=catlin/><ref>{{cite journal
|author = Paul A. Catlin
|author = Paul A. Catlin
|title = Hajós' graph-coloring conjecture: Variations and counterexamples
|title = Hajós' graph-coloring conjecture: Variations and counterexamples
Line 65: Line 57:
|doi = 10.1016/0095-8956(79)90062-5
|doi = 10.1016/0095-8956(79)90062-5
|url= http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin14.pdf
|url= http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin14.pdf
|doi-access = free
}}</ref> which showed that the conjecture raised by [[Hugo Hadwiger]] is further strengthened not only by <math> k \le 4 </math> but also by <math> k \ge 7 </math>,<ref>[[Hadwiger conjecture (graph theory)#Generalizations|Hadwiger's conjecture generalizations]]</ref> which led to the joint paper written with [[Paul Erdős]] and [[Béla Bollobás]] entitled ''Hadwiger's conjecture is true for almost every graph''.<ref name=hadwiger/>
}}</ref> which showed that the conjecture raised by [[Hugo Hadwiger]] is further strengthened not only by <math> k \le 4 </math> but also by <math> k \ge 7 </math>, 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''.<ref name=hadwiger/>

⚫
He authored over fifty academic papers in [[number theory]] and [[graph theory]]. Many of his contributions and collaborations have been published in ''[[Fibonacci Quarterly|The Fibonacci Quarterly]]'', in ''[[Journal of Number Theory|The Journal of Number Theory]]'', in the ''Journal of [[Discrete Mathematics (journal)|Discrete Mathematics]]'', and many other academic publications.<ref name=list/> He co-authored scholarly papers with Arthur M. Hobbs,<ref name=coauthors>{{cite web |url= http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/c/Catlin:Paul_A=.html#coauthors |title= Coauthor index |work = Leibniz Center for Informatics }}</ref> [[Béla Bollobás]] and [[Paul Erdős]],<ref name=hadwiger>{{cite journal
⚫
|author = Paul A. Catlin
⚫
|author2 = Béla Bollobás
⚫
|author3 = Paul Erdős
⚫
|title = Hadwiger's conjecture is true for almost every graph
⚫
|journal = European Journal of Combinatorics
|volume = 1
|issue = 3
|pages = 195
⚫
|year = 1980
|doi = 10.1016/s0195-6698(80)80001-1
|doi-access =
⚫
}}</ref> [[Hong-Jian Lai]], Zheng-Yiao Han, and Yehong Shao,<ref name=coauthors/> among others. He also published papers with [[Neil Robertson (mathematician)|G. Neil Robertson]], with whom he also completed his dissertation thesis in 1976.<ref name=catlin/><ref>{{cite thesis |type=Ph.D. |first=Paul A |last=Catlin |title=Embedding subgraphs and coloring graphs under extremal degree conditions |publisher=Ohio State University |year=1976 |url=http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Dissertation_1.pdf }}</ref>



==Selected publications==
==Published academic papers==


* {{cite journal
* {{cite journal
Line 80: Line 88:
|issue = 5
|issue = 5
|doi = 10.1016/j.disc.2007.11.056
|doi = 10.1016/j.disc.2007.11.056
|doi-access =
}}
}}
* {{cite journal
* {{cite journal
Line 90: Line 99:
|year = 2001
|year = 2001
|pages = 71–97
|pages = 71–97
|issue = 1-3
|issue = 1–3
|doi = 10.1016/S0012-365X(00)00071-6
|doi = 10.1016/S0012-365X(00)00071-6
|doi-access =
}}
}}
* {{cite journal
* {{cite journal
Line 108: Line 118:
|author4= R. Bragg
|author4= R. Bragg
|author5= J. Carlier
|author5= J. Carlier
|title= Proceedings of the First Joint BMES/EMBS Conference. 1999 IEEE Engineering in Medicine and Biology 21st Annual Conference and the 1999 Annual Fall Meeting of the Biomedical Engineering Society (Cat. No.99CH37015)
|title = Do users want telecare and can it be cost-effective
|conference = Annual International Conference of the IEEE Engineering in Medicine and Biology Society
|chapter = Do users want telecare and can it be cost-effective
|conference = Annual International Conference of the IEEE Engineering in Medicine and Biology Society
|volume = 2
|volume = 2
|year = 1999
|year = 1999
|page= 714
|doi = 10.1109/IEMBS.1999.803869
|doi = 10.1109/IEMBS.1999.803869
|isbn= 0-7803-5674-8
}}
}}
* {{cite journal
* {{cite journal
Line 132: Line 145:
|year = 1996
|year = 1996
|pages = 81–91
|pages = 81–91
|issue = 1-3
|issue = 1–3
|doi = 10.1016/S0012-365X(95)00149-Q
|doi = 10.1016/S0012-365X(95)00149-Q
|doi-access =
}}
}}
* {{cite journal
* {{cite journal
Line 142: Line 156:
|year = 1996
|year = 1996
|pages = 67–80
|pages = 67–80
|issue = 1-3
|issue = 1–3
|doi = 10.1016/0012-365X(95)00150-U
|doi = 10.1016/0012-365X(95)00150-U
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 155: Line 170:
|url= http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin01.pdf
|url= http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin01.pdf
|doi=10.2307/2316857
|doi=10.2307/2316857
|jstor= 2316857
}}
}}
* {{cite journal
* {{cite journal
Line 203: Line 219:
|issue = 1
|issue = 1
|doi = 10.1006/jctb.1996.0009
|doi = 10.1006/jctb.1996.0009
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 214: Line 231:
|doi = 10.1016/0095-8956(79)90062-5
|doi = 10.1016/0095-8956(79)90062-5
|url= http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin14.pdf
|url= http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin14.pdf
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 224: Line 242:
|pages = 42–48
|pages = 42–48
|doi=10.1016/0095-8956(79)90066-2
|doi=10.1016/0095-8956(79)90066-2
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 233: Line 252:
|pages = 151–153
|pages = 151–153
|issue = 2
|issue = 2
|doi = 10.1002/(SICI)1097-0118(199606)22:2<151::AID-JGT5>3.0.COand2-M
|doi = 10.1002/(sici)1097-0118(199606)22:2<151::aid-jgt5>3.0.co;2-m
}}
}}
* {{cite book
* {{cite book
Line 249: Line 268:
|publisher = Wiley and Sons, Inc.
|publisher = Wiley and Sons, Inc.
|pages = 207–22
|pages = 207–22
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin38.pdf
|chapter-url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin38.pdf
}}
}}
* {{cite journal
* {{cite journal
Line 259: Line 278:
|year = 1995
|year = 1995
|pages = 37–46
|pages = 37–46
|issue = 1-3
|issue = 1–3
|doi = 10.1016/0012-365X(93)E0205-I
|doi = 10.1016/0012-365X(93)E0205-I
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin46.pdf
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin46.pdf
|doi-access = free
}}
}}
* {{cite book
* {{cite book
|last = Catlin
|last1 = Catlin
|first = Paul A.
|first1 = Paul A.
|last2 = Chen
|last2 = Chen
|first2 = Zhi-Hong
|first2 = Zhi-Hong
Line 275: Line 295:
|year = 1991
|year = 1991
|publisher = Society for Industrial and Applied Mathematics
|publisher = Society for Industrial and Applied Mathematics
|isbn = 0898712874
|isbn = 978-0898712872
}}
}}
* {{cite journal
* {{cite journal
Line 286: Line 306:
|issue = 2
|issue = 2
|doi = 10.1002/jgt.3190160209
|doi = 10.1002/jgt.3190160209
|citeseerx = 10.1.1.385.2901
}}
}}
* {{cite journal
* {{cite journal
Line 292: Line 313:
|author3 = Arthur M. Hobbs
|author3 = Arthur M. Hobbs
|author4 = Hong-jian Lai
|author4 = Hong-jian Lai
|title = Fractional Arboricity Strength and Principal Partitions in Graphs and Matroids
|title = Fractional Arboricity Strength and Principal Partitions in Graphs and Matroids
|journal = Discrete Applied Mathematics
|journal = Discrete Applied Mathematics
|volume = 40
|volume = 40
Line 299: Line 320:
|issue = 3
|issue = 3
|doi = 10.1016/0166-218X(92)90002-R
|doi = 10.1016/0166-218X(92)90002-R
|doi-access =
}}
}}
* {{cite journal
* {{cite journal
Line 309: Line 331:
}}
}}
* {{cite book
* {{cite book
|last = Catlin
|last1 = Catlin
|first = Paul A.
|first1 = Paul A.
|last2 = Chen
|last2 = Chen
|first2 = Zhi-Hong
|first2 = Zhi-Hong
Line 318: Line 340:
|year = 1991
|year = 1991
|pages = 83–95
|pages = 83–95
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin39.pdf
|chapter-url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin39.pdf
}}
}}
* {{cite journal
* {{cite journal
Line 332: Line 354:
|doi = 10.1002/jgt.3190140308
|doi = 10.1002/jgt.3190140308
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin34a.pdf
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin34a.pdf
|citeseerx= 10.1.1.385.3357
}}
}}
* {{cite journal
* {{cite journal
|author = Paul A. Catlin
|author = Paul A. Catlin
|title = Double cycle covers and the petersen graph
|title = Double cycle covers and the petersen graph
|journal = Journal of Graph Theory
|journal = Journal of Graph Theory
|volume = 13
|volume = 13
Line 352: Line 375:
|issue = 2
|issue = 2
|doi = 10.1016/0012-365X(89)90303-8
|doi = 10.1016/0012-365X(89)90303-8
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 361: Line 385:
|pages = 29–44
|pages = 29–44
|issue = 1
|issue = 1
|doi = 10.1002/jgt.319012010
|doi = 10.1002/jgt.3190120105
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin26.pdf
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin26.pdf
}}
}}
Line 373: Line 397:
|issue = 4
|issue = 4
|doi = 10.1007/BF02189088
|doi = 10.1007/BF02189088
|s2cid = 30831342
}}
}}
* {{cite journal
* {{cite journal
Line 383: Line 408:
|issue = 2
|issue = 2
|doi = 10.1016/0095-8956(88)90069-X
|doi = 10.1016/0095-8956(88)90069-X
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 431: Line 457:
|issue = 2
|issue = 2
|doi = 10.1016/0095-8956(81)90066-6
|doi = 10.1016/0095-8956(81)90066-6
|doi-access =
}}
}}
* {{cite journal
* {{cite journal
Line 441: Line 468:
|issue = 1
|issue = 1
|doi = 10.1016/0095-8956(79)90066-2
|doi = 10.1016/0095-8956(79)90066-2
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 451: Line 479:
|issue = 2
|issue = 2
|doi = 10.1016/0012-365X(79)90106-7
|doi = 10.1016/0012-365X(79)90106-7
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 461: Line 490:
|issue = 1 Topics i
|issue = 1 Topics i
|doi = 10.1111/j.1749-6632.1979.tb17770.x
|doi = 10.1111/j.1749-6632.1979.tb17770.x
|bibcode = 1979NYASA.328...95C
|s2cid = 85819734
}}
}}
* {{cite journal
* {{cite journal
Line 480: Line 511:
|issue = 1
|issue = 1
|doi = 10.1016/0012-365X(78)90049-3
|doi = 10.1016/0012-365X(78)90049-3
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 490: Line 522:
|issue = 1
|issue = 1
|doi = 10.1016/0012-365X(78)90167-X
|doi = 10.1016/0012-365X(78)90167-X
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
Line 511: Line 544:
* {{cite journal
* {{cite journal
|author = Paul A. Catlin
|author = Paul A. Catlin
|title = Two problems in metric diophantine approximation I
|title = Two problems in metric diophantine approximation I
|journal = Journal of Number Theory
|journal = Journal of Number Theory
|volume = 8
|volume = 8
Line 518: Line 551:
|issue = 3
|issue = 3
|doi = 10.1016/0022-314X(76)90006-8
|doi = 10.1016/0022-314X(76)90006-8
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
|author = Paul A. Catlin
|author = Paul A. Catlin
|title = Two problems in metric diophantine approximation II
|title = Two problems in metric diophantine approximation II
|journal = Journal of Number Theory
|journal = Journal of Number Theory
|volume = 8
|volume = 8
Line 528: Line 562:
|issue = 3
|issue = 3
|doi = 10.1016/0022-314X(76)90007-X
|doi = 10.1016/0022-314X(76)90007-X
|doi-access = free
}}
}}
* {{cite journal
* {{cite journal
|author= Paul A. Catlin
|author = Paul A. Catlin
|author2 = Béla Bollobás
|author2 = Béla Bollobás
|author3 = Paul Erdős
|author3 = Paul Erdős
|title = Hadwiger’s conjecture is true for almost every graph
|title = Hadwiger's conjecture is true for almost every graph
|journal= European Journal of Combinatorics
|journal = European Journal of Combinatorics
|year= 1980
|volume = 1
|issue = 3
|url = http://www.math.wvu.edu/~hjlai/Pdf/Catlin_Pdf/Catlin18.pdf
|pages = 195
|year = 1980
|doi = 10.1016/s0195-6698(80)80001-1
|doi-access =
}}
}}
* {{cite journal
* {{cite journal
Line 547: Line 586:
|issue = 2
|issue = 2
|doi = 10.1016/0012-365X(74)90119-8
|doi = 10.1016/0012-365X(74)90119-8
|doi-access =
}}
}}
* {{cite journal
* {{cite journal
Line 556: Line 596:
|year= 2001
|year= 2001
|volume= 230
|volume= 230
|issue= 1-3
|issue= 1–3
|pages= 71–97
|pages= 71–97
|doi=10.1016/S0012-365X(00)00071-6
|doi=10.1016/S0012-365X(00)00071-6
|doi-access=
}}
}}


Line 564: Line 605:
{{reflist}}
{{reflist}}


{{Authority control |VIAF= 215369769|LCCN= |GND= |SELIBR= |ORCID= |BNF= |BPN= |RID= |BIBSYS= |ULAN= }}
{{Authority control}}


<!-- Metadata: see [[Wikipedia:Persondata]] -->
{{Persondata
| NAME = Catlin, Paul Allen
| ALTERNATIVE NAMES = Catlin, Paul
| SHORT DESCRIPTION = Mathematician
| DATE OF BIRTH = June 25, 1948
| PLACE OF BIRTH = [[Bridgeport]] [[Connecticut]]
| DATE OF DEATH = April 20, 1995
| PLACE OF DEATH = [[Detroit]] [[Michigan]]
}}
{{DEFAULTSORT:Catlin, Paul}}
{{DEFAULTSORT:Catlin, Paul}}
[[Category:1948 births]]
[[Category:1948 births]]
[[Category:1995 deaths]]
[[Category:1995 deaths]]
[[Category:20th-century American mathematicians]]
[[Category:20th-century American mathematicians]]
[[Category:Number theorists]]
[[Category:American number theorists]]
[[Category:Graph theorists]]
[[Category:Graph theorists]]
[[Category:Ohio State University Graduate School alumni]]
[[Category:Wayne State University faculty]]

Latest revision as of 06:52, 6 May 2024

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

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]

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/enwiki/w/index.php?title=Paul_A._Catlin&oldid=1222487733"