Gabriel Andrew Dirac
Gabriel Andrew Dirac (March 13, 1925 – July 20, 1984) was a mathematician who mainly worked in graph theory. He stated a sufficient condition for a graph to contain a Hamiltonian circuit. In 1951 he conjectured that n points in the plane, not all collinear, must span at least [n/2] 2-point lines, where [x] is the largest integer not exceeding x. This conjecture is still open.[1]
Dirac received his Ph.D. in 1952 from the University of London under Richard Rado.[2]
Dirac was professor of mathematics in the University of Aarhus in Denmark, and was also Erasmus Smith's Professor of Mathematics (1962) at Trinity College Dublin in the mid-1960s. He was the stepson of Paul Dirac and nephew of Eugene Wigner.
See also
- Dirac's theorem on Hamiltonian cycles
- Dirac's theorem on chordal graphs
- Dirac's theorem on cycles in k-connected graphs
Notes
- ↑ Brass, Moser & Pach (2005, p. 304) Research Problems in Discrete Geometry, Springer
- ↑ Gabriel Andrew Dirac at the Mathematics Genealogy Project
References
- L. Døvling Andersen, I. Tafteberg Jakobsen, C. Thomassen, B. Toft, and P. Vestergaard (eds.), Graph Theory in Memory of G.A. Dirac, North-Holland, 1989. ISBN 0-444-87129-2.
|