A breakthrough contribution of Edmonds is the Cobham–Edmonds thesis, defining the concept of polynomial time characterising the difference between a practical and an impractical algorithm (in modern terms, a tractable problem or intractable problem). Today, problems solvable in polynomial time are called the complexity class PTIME, or simply P. Another of Edmonds' earliest and most notable contributions is the blossom algorithm for constructing maximum matchings on graphs, discovered in 1961 and published in 1965. This was the first polynomial-time algorithm for maximum matching in graphs. Its generalization to weighted graphs was a conceptual breakthrough in the use of linear programming ideas in combinatorial optimization. It sealed in the importance of there being proofs, or "witnesses", that the answer for an instance is yes and there being proofs, or "witnesses", that the answer for an instance is no. In this blossom algorithm paper, Edmonds also characterizes feasible problems as those solvable in polynomial time; this is one of the origins of the Cobham–Edmonds thesis.
Additional landmark work of Edmonds is in the area of matroids. He found a polyhedral description for all spanning trees of a graph, and more generally for all independent sets of a matroid. Building on this, as a novel application of linear programming to discrete mathematics, he proved the matroid intersection theorem, a very general combinatorial min-max theorem which, in modern terms, showed that the matroid intersection problem lay in both NP and co-NP.
Edmonds is well known for his theorems on max-weight branching algorithms and packing edge-disjoint branchings and his work with Richard Karp on faster flow algorithms. The Edmonds–Gallai decomposition theorem describes finite graphs from the point of view of matchings. He introduced polymatroids, submodular flows with Richard Giles, and the terms clutter and blocker in the study of hypergraphs. A recurring theme in his work is to seek algorithms whose time complexity is polynomially bounded by their input size and bit-complexity.
Edmonds graduated with a baccalaureate degree from George Washington University in 1958, and obtained a master's degree from the University of Maryland in 1959, with a thesis on the problem of embedding graphs into surfaces.
From 1959 to 1969 he worked at the National Institute of Standards and Technology (then the National Bureau of Standards), and was a founding member of Alan Goldman’s newly created Operations Research Section in 1961.
From 1969 on, with the exception of 1991-1993, he held a faculty position at the Department of Combinatorics and Optimization at the University of Waterloo's Faculty of Mathematics. He supervised the doctoral work of a dozen students in this time.
From 1991 to 1993, he was involved in a dispute ("the Edmonds affair") with the University of Waterloo, wherein the university claimed that a letter submitted constituted a letter of resignation, which Edmonds denied. The conflict was resolved in 1993, and he returned to the university.
- Edmonds, Jack (1991), "A glimpse of heaven", in J.K. Lenstra; A.H.G. Rinnooy Kan; A. Schrijver, ed., History of Mathematical Programming --- A Collection of Personal Reminiscences, CWI, Amsterdam and North-Holland, Amsterdam, pp. 32–54
- Edmonds, Jack (1965). "Paths, trees, and flowers". Can. J. Math. 17: 449&ndash, 467. doi:10.4153/CJM-1965-045-4.
- Edmonds, Jack (1965). "Maximum matching and a polyhedron with 0,1-vertices". Journal of Research of the National Bureau of Standards Section B. 69: 125&ndash, 130.
- Meurant, Gerard (2014). Algorithms and Complexity. p. p. 4. ISBN 978-0-08093391-7.
A problem is said to be feasible if it can be solved in polynomial time (as stated for the first time in Edmonds  [1965, Paths, trees, and flowers])).
- Edmonds, Jack (1971). "Matroids and the greedy algorithm". Math. Programming (Princeton Symposium Math. Prog. 1967). 1: 127&ndash, 136.
- Edmonds, Jack (1970), "Submodular functions, matroids, and certain polyhedra", in R. Guy; H. Hanam; N. Sauer; J. Schonheim, Combinatorial structures and their applications (Proc. 1969 Calgary Conference), Gordon and Breach, New York, pp. 69&ndash, 87.
- Jünger, Michael; Reinelt, Gerhard; Rinaldi, Giovanni, eds. (2003), "Combinatorial Optimization -- Eureka, You Shrink!", Lecture Notes in Computer Science, Springer, 2570
- Edmonds, Jack (1967). "Optimum Branchings". J. Res. Nat. Bur. Standards. 71B: 233&ndash, 240.
- Edmonds, Jack (1973), "Edge-disjoint branchings", Combinatorial Algorithms (Courant Computer Science Symposium 9, Monterey, California, 1972; R. Rustin, ed.), Algorithmics Press, New York: 91&ndash, 96
- Edmonds, Jack; Giles, Richard (1977), "A min-max relation for submodular functions on graphs", Studies in Integer Programming (Proceedings Workshop on Integer Programming, Bonn, 1975; P.L. Hammer, E.L. Johnson, B.H. Korte, G.L. Nemhauser, eds.), Annals of Discrete Mathematics, North-Holland, Amsterdam, 1: 185&ndash, 204
- Christoph Witzgall (2001), "Paths, Trees, and Flowers", A Century of Excellence in Measurements, Standards, and Technology (PDF), National Institute of Standards and Technology, pp. 140&ndash, 144
- UW Gazette, October 7, 1992: CAUT called in on Jack Edmonds case
- Editor's introduction, in: Kenneth Westhues, ed., Workplace Mobbing in Academe: Reports from Twenty Universities, Lewiston: NY: The Edwin Mellen Press, 2004
- University of Waterloo Daily Bulletin, March 5 2001: Conference honours Jack Edmonds