Anthony Hilton

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]

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 ${\displaystyle n-1}$ cells of an ${\displaystyle n\times n}$ matrix are preassigned with no element repeated in any row or column then the remaining ${\displaystyle n^{2}-n+1}$ cells can be filled so as to produce a Latin square." Another noteworthy result states that given a k-regular graph with ${\displaystyle 2n}$ vertices, if ${\displaystyle k\geq 12n/7}$ 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]