Fulkerson Prize [SEP] conferred by
Fulkerson Prize
The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1500 each are presented at each (triennial) International Symposium of the MOS. 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 to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now
Fulkerson Prize.
- József Beck's paper on the discrepancy of hypergraphs, awarded the 1985 Fulkerson Prize.
- Karmarkar's algorithm solving linear programming problems in polynomial time, awarded the 1988 Fulkerson Prize.
- Szegedy's solution of Graham problem on common divisors
- Éva Tardos's paper, awarded the 1988 Fulkerson Prize.
- The proof of El-Zahar and Norbert Sauer of the Hedetniemi's conjecture for 4-chromatic graphs.
- Bollobás's asymptotic value of the chromatic number of random graphs.
-