Anthony Hilton: Difference between revisions
KolbertBot (talk | contribs) m Bot: HTTP→HTTPS |
|||
| Line 5: | Line 5: | ||
== Work == |
== Work == |
||
Much of his work has been done in pioneering techniques in graph theory. He has discovered many results involving [[latin square]]s, including,<ref name="evans" /> which states that "if <math>n-1</math> cells of an <math>n\times n</math> [[Matrix (mathematics)|matrix]] are preassigned with no element repeated in any row or column then the remaining <math>n^2-n+1</math> cells can be filled so as to produce a Latin square." Another noteworthy result states that given a k-regular graph with <math>2n</math> vertices, if <math> k \geq 12n/7</math> then it is [[Graph factorization|1-factorizable]].<ref name="fact">Chetwynd, A. G.; Hilton, A. J. W. (1985), "Regular graphs of high degree are 1-factorizable", Proceedings of the London Mathematical Society 50 (2): 193–206, [https://dx.doi.org/10.1112%2Fplms%2Fs3-50.2.193 doi:10.1112/plms/s3-50.2.193].</ref> |
Much of his work has been done in pioneering techniques in graph theory. He has discovered many results involving [[latin square]]s, including,<ref name="evans" /> which states that "if <math>n-1</math> cells of an <math>n\times n</math> [[Matrix (mathematics)|matrix]] are preassigned with no element repeated in any row or column then the remaining <math>n^2-n+1</math> cells can be filled so as to produce a Latin square." Another noteworthy result states that given a k-regular graph with <math>2n</math> vertices, if <math> k \geq 12n/7</math> then it is [[Graph factorization|1-factorizable]].<ref name="fact">[[Amanda Chetwynd|Chetwynd, A. G.]]; Hilton, A. J. W. (1985), "Regular graphs of high degree are 1-factorizable", Proceedings of the London Mathematical Society 50 (2): 193–206, [https://dx.doi.org/10.1112%2Fplms%2Fs3-50.2.193 doi:10.1112/plms/s3-50.2.193].</ref> |
||
In 1998, he was awarded the [[Euler Medal]] for "a distinguished career in the work he has produced, the people he has trained, and his leadership in the development of combinatorics in Britain." Among the specific things cited for are the creation of two new techniques for solving long standing problems. Through the use of [[edge coloring]]s in the context of embedding [[graph theory|graphs]], he was able to settle the Evan's conjecture,<ref name="evans">Anderson; Hilton (1980), [http://plms.oxfordjournals.org/content/s3-47/3/507.short "Thank Evans!"], [[London Mathematical Society|Proc. London Math. Soc.]], s3–47 (3) 507–522.</ref> and the Lindner conjecture. Through the use of [[graph amalgamation]]s he was able to show many results, including a method for enumerating Hamiltonian decompositions as well as a conjecture about embedding partial triple systems<ref name="trip">Hilton; Roger (1990), [https://link.springer.com/chapter/10.1007/978-94-009-0517-7_10 Edge-Colouring Graphs and Embedding Partial Triple Systems of Even Index], NATO ASI Series, Springer Netherlands, 301 pp 101-112</ref> |
In 1998, he was awarded the [[Euler Medal]] for "a distinguished career in the work he has produced, the people he has trained, and his leadership in the development of combinatorics in Britain." Among the specific things cited for are the creation of two new techniques for solving long standing problems. Through the use of [[edge coloring]]s in the context of embedding [[graph theory|graphs]], he was able to settle the Evan's conjecture,<ref name="evans">Anderson; Hilton (1980), [http://plms.oxfordjournals.org/content/s3-47/3/507.short "Thank Evans!"], [[London Mathematical Society|Proc. London Math. Soc.]], s3–47 (3) 507–522.</ref> and the Lindner conjecture. Through the use of [[graph amalgamation]]s he was able to show many results, including a method for enumerating Hamiltonian decompositions as well as a conjecture about embedding partial triple systems<ref name="trip">Hilton; Roger (1990), [https://link.springer.com/chapter/10.1007/978-94-009-0517-7_10 Edge-Colouring Graphs and Embedding Partial Triple Systems of Even Index], NATO ASI Series, Springer Netherlands, 301 pp 101-112</ref> |
||
Revision as of 06:38, 17 June 2019
Anthony J. W. Hilton (born 4 April 1941) is a British mathematician specializing in combinatorics and graph theory. His current positions are as emeritus professor of Combinatorial Mathematics at the University of Reading and Professorial Research Fellow at Queen Mary College, University of London.
Education
From 1951 to 1959, he attended the Bedford School in Bedford, Bedfordshire, England. From there he attended Reading University, where he earned a bachelor's degree in 1963 and was awarded a PhD in 1967.[1] His dissertation was "Representation Theorems for Integers and Real Numbers" under his advisor David E. Daykin.[2]
Work
Much of his work has been done in pioneering techniques in graph theory. He has discovered many results involving latin squares, including,[3] which states that "if cells of an matrix are preassigned with no element repeated in any row or column then the remaining cells can be filled so as to produce a Latin square." Another noteworthy result states that given a k-regular graph with vertices, if then it is 1-factorizable.[4]
In 1998, he was awarded the Euler Medal for "a distinguished career in the work he has produced, the people he has trained, and his leadership in the development of combinatorics in Britain." Among the specific things cited for are the creation of two new techniques for solving long standing problems. Through the use of edge colorings in the context of embedding graphs, he was able to settle the Evan's conjecture,[3] and the Lindner conjecture. Through the use of graph amalgamations he was able to show many results, including a method for enumerating Hamiltonian decompositions as well as a conjecture about embedding partial triple systems[5]
References
- ^ Hilton, Anthony, Personal Homepage
- ^ Anthony Hilton, The Mathematics Genealogy Project
- ^ a b Anderson; Hilton (1980), "Thank Evans!", Proc. London Math. Soc., s3–47 (3) 507–522.
- ^ Chetwynd, A. G.; Hilton, A. J. W. (1985), "Regular graphs of high degree are 1-factorizable", Proceedings of the London Mathematical Society 50 (2): 193–206, doi:10.1112/plms/s3-50.2.193.
- ^ Hilton; Roger (1990), Edge-Colouring Graphs and Embedding Partial Triple Systems of Even Index, NATO ASI Series, Springer Netherlands, 301 pp 101-112
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
