Fulkerson Prize

Prize

Description

A pioneer in modern operations research, Delbert Ray Fulkerson (1924-1976) made fundamental contributions to network flow theory and combinatorial analysis. The AMS-MOS Fulkerson Prize was established in his honor after his death to encourage mathematical excellence in discrete mathematics, including graph theory, networks, mathematical programming, applied combinatorics, applications of discrete mathematics to computer science, and related subjects. The triennial prize currently is funded by an endowment administered by the Mathematical Optimization Society

Nathan Keller and Noam Lifshitz received the prize for "The Junta Method for Hypergraphs and the Erdős-Chvátal Simplex Conjecture," published in Advances in Mathematics in 2021.

“The authors give a new approach for solving Turán-type problems, which concern the maximum number of edges a hypergraph can have without containing certain expansions of a given forbidden substructure,” according to the citation. “The junta method approximates these hypergraphs by juntas, and the authors successfully apply it to the Erdős–Chvátal simplex conjecture, the Erdős–Sós forbidding one intersection problem, and the Frankl–Füredi special simplex problem.”
Degree of recognitionInternational
Granting OrganizationsAmerican Mathematical Society

Awarded at event

Event title25th International Symposium on Mathematical Programming
Location, Montréal, CanadaShow on map
Period22 Jul 2024 → 22 Jul 2024

    Fingerprint