# D. R. Fulkerson

> American mathematician (1924–1976)

**Wikidata**: [Q1184009](https://www.wikidata.org/wiki/Q1184009)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/D._R._Fulkerson)  
**Source**: https://4ort.xyz/entity/d-r-fulkerson

## Summary
D. R. Fulkerson was an American mathematician (1924–1976) and computer scientist, known for his contributions to combinatorics and optimization. He earned his PhD under Cyrus Colton MacDuffee and made significant advancements in network flow theory and matching problems.

## Biography
- Born: August 14, 1924, in Tamms, United States
- Nationality: United States
- Education: PhD from University of Wisconsin–Madison (advised by Cyrus Colton MacDuffee)
- Known for: Pioneering work in network flow theory and matching problems in combinatorics
- Employer(s): University of Wisconsin–Madison (educated at), later affiliated with Princeton University
- Field(s): Combinatorics, computer science

## Contributions
D. R. Fulkerson made foundational contributions to combinatorial optimization, particularly in network flow theory. His 1956 paper with I. Glicksberg and R. W. Haver titled "Maximal Flow Through a Network" introduced the max-flow min-cut theorem, a cornerstone of operations research. He also co-authored the 1961 paper "On Impartial Games" with H. W. Kuhn, advancing game theory. Fulkerson’s work on bipartite matching and the concept of "blocking sets" furthered his legacy in discrete mathematics. His research laid the groundwork for modern optimization algorithms, influencing fields like logistics, computer science, and economics.

## FAQs
### Q: What was D. R. Fulkerson’s most famous mathematical contribution?
A: Fulkerson is best known for the max-flow min-cut theorem, published in 1956, which revolutionized network flow theory and has applications in logistics and computer science.

### Q: Who were D. R. Fulkerson’s academic advisors?
A: He was advised by Cyrus Colton MacDuffee during his PhD studies at the University of Wisconsin–Madison.

### Q: What field did D. R. Fulkerson work in?
A: Fulkerson worked in combinatorics and computer science, with a focus on optimization problems and network theory.

### Q: How did D. R. Fulkerson die?
A: He died by suicide on January 10, 1976.

### Q: What awards did D. R. Fulkerson receive?
A: He won the Paul R. Halmos - Lester R. Ford Awards in 1967.

## Why They Matter
D. R. Fulkerson’s work in network flow theory and combinatorial optimization laid the foundation for modern algorithms used in logistics, computer science, and economics. His max-flow min-cut theorem remains a fundamental result in operations research, and his contributions to bipartite matching and game theory have influenced discrete mathematics. Fulkerson’s research continues to shape optimization techniques, demonstrating the enduring impact of his theoretical advancements.

## Notable For
- Co-authored the max-flow min-cut theorem (1956), a foundational result in network theory.
- Won the Paul R. Halmos - Lester R. Ford Awards in 1967.
- Advised notable mathematicians, including Robert G. Bland and David B. Weinberger.
- Died by suicide in 1976, leaving behind a legacy in combinatorics and optimization.

## Body
### Early Life and Education
D. R. Fulkerson was born on August 14, 1924, in Tamms, United States. He earned his PhD from the University of Wisconsin–Madison under the supervision of Cyrus Colton MacDuffee, focusing on combinatorics and optimization.

### Academic Career
Fulkerson’s academic career was marked by groundbreaking contributions to network flow theory. His collaboration with I. Glicksberg and R. W. Haver on the max-flow min-cut theorem in 1956 established a key result in operations research. He later co-authored "On Impartial Games" with H. W. Kuhn in 1961, advancing game theory. His work on bipartite matching and blocking sets furthered his reputation in discrete mathematics.

### Legacy and Influence
Fulkerson’s research laid the groundwork for modern optimization algorithms, influencing fields like logistics, computer science, and economics. His Erdős number of 2 reflects his connections to influential mathematicians. Despite his untimely death in 1976, his work continues to shape theoretical and applied mathematics.

### Awards and Recognition
Fulkerson received the Paul R. Halmos - Lester R. Ford Awards in 1967, recognizing his contributions to combinatorial mathematics. His academic achievements and theoretical innovations cemented his place as a pioneer in optimization and network theory.

## References

1. Integrated Authority File
2. Mathematics Genealogy Project
3. general catalog of BnF
4. Faceted Application of Subject Terminology
5. Virtual International Authority File
6. CiNii Research
7. Freebase Data Dumps. 2013
8. IdRef
9. CONOR.SI