grant

AF:Small: Extremal Combinatorics and Analysis of Algorithms

Organization Regents of the University of Michigan - Ann ArborLocation ANN ARBOR, United StatesPosted 1 Jan 2026Deadline 31 Dec 2028
NSFUS FederalResearch GrantScience FoundationMI
Sign up free to applyApply link · pipeline · email alerts
— or —

Get email alerts for similar roles

Weekly digest · no password needed · unsubscribe any time

Description preview

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…

🔒

Full details available on the Agency plan

Unlock the complete grant description, eligibility criteria, contract value, evaluation details and apply link — plus alerts, pipeline tracking, and CSV export.

Start 7-day free trial — $29.99/mo →

Agency Plan

7-day free trial

Unlock procurement & grants

Upgrade to access active tenders from World Bank, UNDP, ADB and more — with email alerts and pipeline tracking.

$29.99 / month

  • 🔔Email alerts for new matching tenders
  • 🗂️Track tenders in your pipeline
  • 💰Filter by contract value
  • 📥Export results to CSV
  • 📌Save searches with one click
Start 7-day free trial →
AF:Small: Extremal Combinatorics and Analysis of Algorithms — Regents of the University of Michigan - Ann Arbor | United | Dev Procure