Project Grant 2154331
Award Date
8/15/22
Completion Date
7/31/25
Dollars Obligated
$180K
Federal Agency
Division of Mathematical Sciences
Federal Grant Program
47.049
Assistance Type
Project Grant
Place of Performance
Atlanta, GA 30302, USA
Similar Awards
The National Science Foundation (NSF) awarded a $260,846 Project Grant under the Mathematical and Physical Sciences (MPS) program (CFDA 47.049) to the Georgia Tech Research Corporation (Georgia Tech) for research on graph coloring and graph structure. This three-year project (6/1/2024 - 5/31/2027) will investigate the existence of certain graph configurations and their connections to global graph properties, building on prior work on the Four Color Theorem and related conjectures. The research...
This $137,955 federal Project Grant award from the National Science Foundation's Mathematical and Physical Sciences program (CFDA 47.049) supports research by the University of Massachusetts Lowell on edge coloring and packing algorithms for graph theory applications in areas like network theory, communication, scheduling, and optimization. The principal investigator plans to explore the theoretical aspects of edge coloring and packing, as well as develop efficient algorithms, with the...
This $210,000 Project Grant awarded by the National Science Foundation (NSF) under the Mathematical and Physical Sciences (CFDA 47.049) program supports research on combinatorial models in representation theory, geometry, and analysis. The principal investigator (PI) at Smith College will analyze two types of edge-labeled graphs - webs and algebraic splines - with applications in areas like knot theory, representation theory, combinatorics, and data compression/interpolation. The project will...
This National Science Foundation project grant of $740,162 will fund collaborative research on extremal combinatorics and flag algebras from August 2022 through July 2025. The awardee is the University of Colorado Denver under the Mathematical and Physical Sciences program (CFDA 47.049). The research aims to resolve three prominent open questions in extremal combinatorics posed by Erdös, Turán, and Zarankiewicz using flag algebra techniques. The questions concern extremal hypergraph...
This National Science Foundation Project Grant of $498,686 supports research into graph theory at California State University, Stanislaus from August 2022 through July 2024. The grant funds investigation into the Erdos-Korado property of well-covered graphs and related concepts for certain classes of graphs. Undergraduate student researchers will work in pairs on parts of the project to study the maximum size of intersecting families of independent sets of fixed size in graphs. They will gain...
This National Science Foundation (NSF) Project Grant award under the Mathematical and Physical Sciences program (CFDA 47.049) in the amount of $249,397 supports research into the anti-Ramsey properties of graphs and other combinatorial objects. The project aims to study rainbow substructures in colored graphs, sets of integers, and integers modulo N, with a focus on determining rainbow numbers - the minimum number of colors needed to guarantee a rainbow arithmetic progression. The research...
This Project Grant from the National Science Foundation's Division of Mathematical Sciences, under the Mathematical and Physical Sciences program (CFDA 47.049), provides $205,601 to the University of Massachusetts for research related to enumerative, algebraic, and asymptotic combinatorics with connections to representation theory and geometry. Specifically, the award supports three research projects that will study problems in graph colorings, Schubert polynomials, and integer flows on graphs...
This $300,000 Project Grant from the National Science Foundation Division of Mathematical Sciences, under the Mathematical and Physical Sciences program (CFDA 47.049), will support further research into the algebra, geometry, and combinatorics of matroids at Georgia Tech Research Corporation from October 1, 2022 to September 30, 2025. The Principal Investigator and collaborators will prove new results about matroid representations, including representations of 3-connected matroids and quaternary...
This three-year, $130,029 National Science Foundation project grant supports mathematical research on optimizing local graph conditions to force global structural properties. The awardee, University of South Florida, will investigate extremal combinatorics questions regarding graphs and directed graphs using probabilistic methods including the absorbing technique and regularity method. Graduate students will assist with research to support their professional development. Outcomes will further...
This $300,000 Project Grant from the National Science Foundation Division of Mathematical Sciences under the Mathematical and Physical Sciences program (CFDA 47.049) will fund research into spectral methods for single and multiple graph inference networks. The grantee, North Carolina State University, will develop efficient parameter estimation methods for latent position graphs and valid two-sample testing procedures for comparing latent position graphs while ignoring irrelevant features. The...