AF:Small: Extremal Combinatorics and Analysis of Algorithms — NSF Award to Regents of the University of Michigan - Ann Arbor (MI,
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
| Award title | AF:Small: Extremal Combinatorics and Analysis of Algorithms |
|---|---|
| Award ID | 2446604 |
| Awardee | Regents of the University of Michigan - Ann Arbor |
| City | ANN ARBOR |
| State | MI |
| Amount obligated | $600,000 |
| Principal investigator | Seth Pettie |
| Program | Algorithmic Foundations |
| Start date | 01/01/2026 |
| 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 the theory of pattern avoiding 0-1 matrices, which studies the following type of |
| Source | NSF Awards |
$799/mo
Try NSFGrants →