Division of Mathematical Sciences
|Tomek Bartoszynskiemail@example.com||(703) 292-4885||E 8449|
|Stefaan De Winterfirstname.lastname@example.org||(703) 292-2599||E 8446|
Apply to PD 18-7970 as follows:
For full proposals submitted via FastLane: standard NSF Proposal & Award Policies & Procedures Guide proposal preparation guidelines apply.
For full proposals submitted via Grants.gov: the NSF Grants.gov Application Guide: A Guide for the Preparation and Submission of NSF Applications via Grants.gov Guidelines applies. (Note: The NSF Grants.gov Application Guide is available on the Grants.gov website and on the NSF website at: http://www.nsf.gov/publications/pub_summ.jsp?ods_key=grantsgovguide)
Important Information for Proposers
ATTENTION: Proposers using the Collaborators and Other Affiliations template for more than 10 senior project personnel will encounter proposal print preview issues. Please see the Collaborators and Other Affiliations Information website for updated guidance.
A revised version of the NSF Proposal & Award Policies & Procedures Guide (PAPPG) (NSF 18-1), is effective for proposals submitted, or due, on or after January 29, 2018. Please be advised that, depending on the specified due date, the guidelines contained in NSF 18-1 may apply to proposals submitted in response to this funding opportunity.
Full Proposal Target Date
September 25, 2018
Fourth Tuesday in September, Annually Thereafter
The Combinatorics program supports research on discrete structures and includes algebraic, enumerative, existential, extremal, geometric, and probabilistic combinatorics, including graph theory.
Principal Investigators should carefully read the program solicitation "Conferences and Workshops in the Mathematical Sciences" (link below) to obtain important information regarding the substance of proposals for conferences, workshops, summer/winter schools, and similar activities. Conference proposals must be submitted at least six months in advance of the conference, and in the same fiscal year (which begins October 1) if possible.