Gabriel Andrew Dirac | |
|---|---|
| Born | 13 March 1925 |
| Died | 20 July 1984 (aged 59) |
| Education | Ph.D. |
| Alma mater | St John's College, Cambridge University of London |
| Known for | Graph theory |
| Scientific career | |
| Fields | Mathematics |
| Institutions | University of Aarhus, Trinity College Dublin |
| Thesis | On the Colouring of Graphs: Combinatorial topology of Linear Complexes (1952) |
| Doctoral advisor | Richard Rado |
Gabriel Andrew Dirac (13 March 1925 – 20 July 1984) was a Hungarian-British mathematician who mainly worked in graph theory.[1] He served as Erasmus Smith's Professor of Mathematics at Trinity College Dublin from 1964 to 1966.[2] In 1952, he gave a sufficient condition for a graph to contain a Hamiltonian circuit. The previous year, he conjectured that n points in the plane, not all collinear, must span at least two-point lines, where is the largest integer not exceeding . This conjecture was proven true when n is sufficiently large by Green and Tao in 2012.[3]
- ^ Thomassen, Carsten (1985). "Gabriel Andrew Dirac Obituary". Journal of Graph Theory. 9: 303–318. doi:10.1002/jgt.3190090302. S2CID 28656582. Retrieved 1 May 2021.
- ^ Webb, D.A. (1992). J.R., Barlett (ed.). Trinity College Dublin Record Volume 1991. Dublin: Trinity College Dublin Press. ISBN 1-871408-07-5.
- ^ Green, Ben; Tao, Terence (23 August 2012). "On sets defining few ordinary lines". arXiv:1208.4714 [math.CO].