NSF award 2446604 · Regents of the University of Michigan - Ann Arbor

AF:Small: Extremal Combinatorics and Analysis of Algorithms

Final report due

30 April 2029

in 925 days · The award ends on 31 December 2028.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Sep 2028in 685 days
award ending 2028-12-31 · Research.gov
This one is ours, not NSF’s.
Extension request16 Nov 2028in 760 days
award ending 2028-12-31 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice21 Dec 2028in 795 days
award ending 2028-12-31 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due30 Apr 2029in 925 days
award ending 2028-12-31 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due30 Apr 2029in 925 days
award ending 2028-12-31 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out30 Apr 2029in 925 days
award ending 2028-12-31 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 31 December 2028.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 30 April 2029.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2446604
Period of support: 1 Jan 2026 – 31 Dec 2028
Amount: $600,000
Awardee: Regents of the University of Michigan - Ann Arbor, ANN Arbor, MI
Program: Algorithmic Foundations
Directorate: CSE

Abstract

Extremal combinatorics is an area of discrete mathematics that studies questions of how large an object can be while still avoiding a certain pattern. For example, how many people can be at a party where no group of 4 people are mutual friends nor mutual strangers? Or, how many points can be placed in a grid so that no three are on a line? The first goal of this project is to solve basic classification questions in…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.