*Photo courtesy of Leslie Trotter, Jr.*

The Fulkerson Prize is awarded for outstanding papers in the area of discrete mathematics. The term "discrete mathematics" is interpreted broadly and is intended to include graph theory, networks, mathematical programming, applied combinatorics, applications of discrete mathematics to computer science, and related subjects.
### About this Prize

**Most Recent Prize: 2018**

**See previous winners**

**Next Prize:**
July 2022

**Nomination Deadline:**
15 February 2024

Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson (1924-1976) to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by the Mathematical Optimization Society.

This award is sponsored jointly by the Mathematical Optimization Society (formerly the Mathematical Programming Society) and the American Mathematical Society (AMS). Up to three awards of US$1500 are presented at each (triennial) International Symposium of the MPS. Eligible papers should represent the final publication of the main result(s) and should have been published in a recognized journal or in a comparable, well-refereed volume intended to publish final publications only, during the six calendar years preceding the year of the Symposium (thus, from January 2015 through December 2020). The prizes will be given for single papers, not series of papers or books, and in the event of joint authorship the prize will be divided.

The term "discrete mathematics" is interpreted broadly and is intended to include graph theory, networks, mathematical programming, applied combinatorics, applications of discrete mathematics to computer science, and related subjects. While research work in these areas is usually not far removed from practical applications, the judging of papers will be based only on their mathematical quality and significance.

The 2018 Delbert Ray Fulkerson Prize was awarded to **Peter Allen**, **Julia Böttcher**, **Simon Griffiths**, **Yoshiharu Kohayakawa**, **Robert Morris** for "The chromatic thresholds of graphs", *Adv. Math.* 235, 261-295 (2013). It was also awarded to **Thomas Rothvoß** for " The Matching Polytope has Exponential Extension Complexity.", *J. ACM *64(6): 41:1-41:19 (2017).

**Nomination Procedure:**

To nominate a candidate, submit a letter of nomination (including reference to the nominated article and an evaluation of the work) to the chair of the committee. Electronic submissions to gc0v@andrew.cmu.edu are preferred.

Gerard Cornuejols

Tepper School of Business

Carnegie Mellon University

5000 Forbes Avenue

Pittsburgh, PA 15213, USA